A framework for statistically sender private OT with optimal rate
From MaRDI portal
Publication:6186604
DOI10.1007/978-3-031-38557-5_18MaRDI QIDQ6186604
Nico Döttling, Pedro Branco, Akshayaram Srinivasan
Publication date: 2 February 2024
Published in: Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Smooth projective hashing and two-message oblivious transfer
- Two-message statistically sender-private OT from LWE
- Statistical witness indistinguishability (and more) in two messages
- Distinguisher-dependent simulation in two rounds and its applications
- Two-message witness indistinguishability and secure computation in the plain model from new assumptions
- Statistical ZAP arguments
- Statistical Zaps and new oblivious transfer protocols
- Constant ciphertext-rate non-committing encryption from standard assumptions
- Efficient range-trapdoor functions and applications: rate-1 OT and more
- Non-interactive zero knowledge from sub-exponential DDH
- Efficient pseudorandom correlation generators from ring-LPN
- NIZK from LPN and trapdoor hash via correlation intractability for approximable relations
- On statistical security in two-party computation
- Batch-OT with optimal rate
- Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles
- Compressible FHE with applications to PIR
- Trapdoor hash functions and their applications
- Efficient pseudorandom correlation generators: silent OT extension and more
- Simpler statistically sender private oblivious transfer from ideals of cyclotomic integers
- Amortizing rate-1 OT and applications to PIR and PSI
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Breaking the Circuit Size Barrier for Secure Computation Under DDH
- Maliciously Circuit-Private FHE
- Lossy trapdoor functions and their applications
- Evaluating Branching Programs on Encrypted Data
- Garbled Circuits as Randomized Encodings of Functions: a Primer
- Advances in Cryptology - CRYPTO 2003
- Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
- Algebraic restriction codes and their applications
- Sublinear secure computation from new assumptions
- Statistical security in two-party computation revisited
- Statistically sender-private OT from LPN and derandomization
This page was built for publication: A framework for statistically sender private OT with optimal rate
