A framework for statistically sender private OT with optimal rate
From MaRDI portal
(Redirected from Publication:6186604)
Recommendations
Cites work
- Advances in Cryptology - CRYPTO 2003
- Algebraic restriction codes and their applications
- Amortizing rate-1 OT and applications to PIR and PSI
- Batch-OT with optimal rate
- Breaking the circuit size barrier for secure computation under DDH
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Compressible FHE with applications to PIR
- Constant ciphertext-rate non-committing encryption from standard assumptions
- Cryptography with constant computational overhead
- Distinguisher-dependent simulation in two rounds and its applications
- Efficient oblivious transfer protocols
- Efficient pseudorandom correlation generators from ring-LPN
- Efficient pseudorandom correlation generators: silent OT extension and more
- Efficient range-trapdoor functions and applications: rate-1 OT and more
- Evaluating Branching Programs on Encrypted Data
- Garbled circuits as randomized encodings of functions: a primer
- Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
- scientific article; zbMATH DE number 1722674 (Why is no real title available?)
- scientific article; zbMATH DE number 3960854 (Why is no real title available?)
- scientific article; zbMATH DE number 2086626 (Why is no real title available?)
- Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles
- Lossy trapdoor functions and their applications
- Maliciously circuit-private FHE
- NIZK from LPN and trapdoor hash via correlation intractability for approximable relations
- Non-interactive zero knowledge from sub-exponential DDH
- On statistical security in two-party computation
- Simpler statistically sender private oblivious transfer from ideals of cyclotomic integers
- Smooth projective hashing and two-message oblivious transfer
- Statistical security in two-party computation revisited
- Statistical witness indistinguishability (and more) in two messages
- Statistical ZAP arguments
- Statistical Zaps and new oblivious transfer protocols
- Statistically sender-private OT from LPN and derandomization
- Sublinear secure computation from new assumptions
- Trapdoor hash functions and their applications
- Two-message statistically sender-private OT from LWE
- Two-message witness indistinguishability and secure computation in the plain model from new assumptions
Cited in
(4)
This page was built for publication: A framework for statistically sender private OT with optimal rate
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6186604)
