Laconic branching programs from the Diffie-Hellman assumption

DOI10.1007/978-3-031-57725-3_11MaRDI QIDQ6635828

Peihan Miao, Sanjam Garg, Alice Murphy, Mohammad Hajiabadi

Publication date: 12 November 2024

zbMATH Keywords

branching programslaconic cryptographyunbalanced secure computation

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Cites Work

• Registration-based encryption: removing private-key generator from IBE
• Anonymous IBE, leakage resilience and circular security from new assumptions
• Identity-based encryption from the Diffie-Hellman assumption
• Laconic oblivious transfer and its applications
• Efficient range-trapdoor functions and applications: rate-1 OT and more
• New techniques for efficient trapdoor functions and applications
• Trapdoor hash functions and their applications
• Laconic private set intersection and applications
• Amortizing rate-1 OT and applications to PIR and PSI
• Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
• Evaluating Branching Programs on Encrypted Data
• Fully homomorphic encryption using ideal lattices
• Efficient laconic cryptography from learning with errors
• Structure-aware private set intersection, with applications to fuzzy matching

Related Items (1)

Computation efficient structure-aware PSI from incremental function secret sharing

This page was built for publication: Laconic branching programs from the Diffie-Hellman assumption