Laconic private set intersection and applications
From MaRDI portal
Publication:2697887
DOI10.1007/978-3-030-90456-2_4OpenAlexW3214753478MaRDI QIDQ2697887
Pedro Branco, Mohammad Hajiabadi, Sihang Pu, Nico Döttling, Sanjam Garg, Navid Alamati
Publication date: 13 April 2023
Full work available at URL: https://doi.org/10.1007/978-3-030-90456-2_4
Related Items (6)
Batch-OT with optimal rate ⋮ Hiding the input-size in multi-party private set intersection ⋮ Efficient laconic cryptography from learning with errors ⋮ End-to-end secure messaging with traceability only for illegal content ⋮ Sublinear secure computation from new assumptions ⋮ One-time programs from commodity hardware
Cites Work
- Unnamed Item
- Unnamed Item
- Registration-based encryption: removing private-key generator from IBE
- Anonymous IBE, leakage resilience and circular security from new assumptions
- Two-round multiparty secure computation from minimal assumptions
- \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits
- Efficient circuit-based PSI via cuckoo hashing
- Identity-based encryption from the Diffie-Hellman assumption
- Laconic oblivious transfer and its applications
- From selective IBE to full IBE and selective HIBE
- New constructions of identity-based and key-dependent message secure encryption schemes
- Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits
- New constructions of hinting PRGs, OWFs with encryption, and more
- Verifiable registration-based encryption
- Registration-based encryption from standard assumptions
- New techniques for efficient trapdoor functions and applications
- Trapdoor hash functions and their applications
- Faster unbalanced private set intersection
- Breaking the Circuit Size Barrier for Secure Computation Under DDH
- Hiding the Input-Size in Secure Two-Party Computation
- On the Communication Complexity of Secure Function Evaluation with Long Output
- (If) Size Matters: Size-Hiding Private Set Intersection
- Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability
- Fast Secure Computation of Set Intersection
- Perfect Non-interactive Zero Knowledge for NP
- Evaluating Branching Programs on Encrypted Data
- Privacy-Preserving Set Operations
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Theory of Cryptography
- Scalable Multi-party Private Set-Intersection
This page was built for publication: Laconic private set intersection and applications