Batch-OT with optimal rate
From MaRDI portal
Publication:2170043
DOI10.1007/978-3-031-07085-3_6zbMath1496.94030OpenAlexW4285126658MaRDI QIDQ2170043
Pedro Branco, Sihang Pu, Zvika Brakerski, Nico Döttling
Publication date: 30 August 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-07085-3_6
Related Items
Sublinear-communication secure multiparty computation does not require FHE ⋮ Rai-Choo! Evolving blind signatures to the next level ⋮ Sublinear secure computation from new assumptions ⋮ A framework for statistically sender private OT with optimal rate
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New bounds in some transference theorems in the geometry of numbers
- Laconic oblivious transfer and its applications
- Constant ciphertext-rate non-committing encryption from standard assumptions
- Efficient range-trapdoor functions and applications: rate-1 OT and more
- New constructions of hinting PRGs, OWFs with encryption, and more
- Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles
- Compressible FHE with applications to PIR
- Trapdoor hash functions and their applications
- Reusable non-interactive secure computation
- Efficient pseudorandom correlation generators: silent OT extension and more
- Maliciously secure oblivious linear function evaluation with constant overhead
- Laconic private set intersection and applications
- Amortizing rate-1 OT and applications to PIR and PSI
- FHE Circuit Privacy Almost for Free
- Breaking the Circuit Size Barrier for Secure Computation Under DDH
- Low Noise LPN: KDM Secure Public Key Encryption and Sample Amplification
- On the Cryptographic Applications of Random Functions (Extended Abstract)
- An Efficient and Parallel Gaussian Sampler for Lattices
- Circular-Secure Encryption from Decision Diffie-Hellman
- Secure Arithmetic Computation with No Honest Majority
- Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography
- Two-Round Oblivious Linear Evaluation from Learning with Errors
- Functional Signatures and Pseudorandom Functions
- Advances in Cryptology - CRYPTO 2003
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- On lattices, learning with errors, random linear codes, and cryptography
