Oblivious transfer with constant computational overhead
From MaRDI portal
Publication:6138086
DOI10.1007/978-3-031-30545-0_10zbMath1530.94023OpenAlexW4365935939MaRDI QIDQ6138086
Elette Boyle, Niv Gilboa, Geoffroy Couteau, Yuval Ishai, Lisa Kohl, Peter Scholl, Nicolas Resch
Publication date: 16 January 2024
Published in: Advances in Cryptology – EUROCRYPT 2023 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-30545-0_10
constant-overhead pseudorandom correlation generatorsecure two-party computation of Boolean circuits
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A dichotomy for local small-bias generators
- Cryptographic hardness of random local functions. Survey
- On linear-size pseudorandom generators and hardcore functions
- Quasi-optimal SNARGs via linear multi-prover interactive proofs
- Secure arithmetic computation with constant computational overhead
- Limits on the locality of pseudorandom generators and applications to indistinguishability obfuscation
- Linear-time zero-knowledge proofs for arithmetic circuit satisfiability
- On the concrete security of Goldreich's pseudorandom generator
- Security and composition of multiparty cryptographic protocols
- Efficient pseudorandom correlation generators from ring-LPN
- Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes
- Asymptotically quasi-optimal cryptography
- Secure non-interactive simulation: feasibility and rate
- Secure non-interactive reduction and spectral analysis of correlations
- Efficient pseudorandom correlation generators: silent OT extension and more
- More efficient oblivious transfer extensions
- On the One-Way Function Candidate Proposed by Goldreich
- Constrained Pseudorandom Functions and Their Applications
- Function Secret Sharing
- New Algorithms for Learning in Presence of Errors
- Candidate One-Way Functions Based on Expander Graphs
- Binary AMD Circuits from Secure Multiparty Computation
- Actively Secure OT Extension with Optimal Overhead
- Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
- Founding Cryptography on Oblivious Transfer – Efficiently
- On the Security of Goldreich’s One-Way Function
- Foundations of Cryptography
- Cryptographic Hardness of Random Local Functions–Survey
- On the Power of Correlated Randomness in Secure Computation
- Locally Computable UOWHF with Linear Shrinkage
- Extracting Correlations
- XOR Codes and Sparse Learning Parity with Noise
- Circuits resilient to additive attacks with applications to secure computation
- Algebraic attacks against random local functions and their countermeasures
- Functional Signatures and Pseudorandom Functions
- Pseudorandom generators with long stretch and low locality from random local one-way functions
- Distributed Point Functions and Their Applications
- Advances in Cryptology - CRYPTO 2003
- Progress in Cryptology – Mycrypt 2005
- Cryptography in $NC^0$
- TinyKeys: a new approach to efficient multi-party computation
- On perfectly secure 2PC in the OT-hybrid model
- The exact complexity of pseudorandom functions and the black-box natural proof barrier for bootstrapping results in computational complexity
- Proving as fast as computing: succinct arguments with constant prover overhead
- Faster sounder succinct arguments and \textsf{IOP}s
- Correlated pseudorandomness from expand-accumulate codes
This page was built for publication: Oblivious transfer with constant computational overhead
