Amortizing rate-1 OT and applications to PIR and PSI
From MaRDI portal
Publication:2697889
DOI10.1007/978-3-030-90456-2_5OpenAlexW3213275511MaRDI QIDQ2697889
Sanjam Garg, Peihan Miao, Mohammad Hajiabadi, Melissa Chase, Jia-lin Li
Publication date: 13 April 2023
Full work available at URL: https://doi.org/10.1007/978-3-030-90456-2_5
Related Items (3)
Batch-OT with optimal rate ⋮ Credibility in private set membership ⋮ A framework for statistically sender private OT with optimal rate
Cites Work
- Smooth projective hashing and two-message oblivious transfer
- Anonymous IBE, leakage resilience and circular security from new assumptions
- Efficient circuit-based PSI via cuckoo hashing
- Identity-based encryption from the Diffie-Hellman assumption
- Laconic oblivious transfer and its applications
- Two-message witness indistinguishability and secure computation in the plain model from new assumptions
- Trapdoor functions from the computational Diffie-Hellman assumption
- 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
- Chosen ciphertext security from injective trapdoor functions
- Private set intersection in the internet setting from lightweight oblivious PRF
- NIZK from LPN and trapdoor hash via correlation intractability for approximable relations
- PSI from PaXoS: fast, malicious private set intersection
- Two-round oblivious transfer from CDH or LPN
- New techniques for efficient trapdoor functions and applications
- Efficient circuit-based PSI with linear communication
- Trapdoor hash functions and their applications
- SpOT-light: lightweight private set intersection from sparse OT extension
- New constructions of reusable designated-verifier NIZKs
- Realizing chosen ciphertext security generically in attribute-based encryption and predicate encryption
- Breaking the Circuit Size Barrier for Secure Computation Under DDH
- (If) Size Matters: Size-Hiding Private Set Intersection
- Evaluating Branching Programs on Encrypted Data
- A Framework for Efficient and Composable Oblivious Transfer
- Advances in Cryptology - CRYPTO 2003
- CCA security and trapdoor functions via key-dependent-message security
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Amortizing rate-1 OT and applications to PIR and PSI
