Laconic branching programs from the Diffie-Hellman assumption
From MaRDI portal
(Redirected from Publication:6635828)
Recommendations
Cites work
- Amortizing rate-1 OT and applications to PIR and PSI
- Anonymous IBE, leakage resilience and circular security from new assumptions
- Efficient laconic cryptography from learning with errors
- Efficient range-trapdoor functions and applications: rate-1 OT and more
- Evaluating Branching Programs on Encrypted Data
- Fully homomorphic encryption using ideal lattices
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Identity-based encryption from the Diffie-Hellman assumption
- Laconic oblivious transfer and its applications
- Laconic private set intersection and applications
- New techniques for efficient trapdoor functions and applications
- Registration-based encryption: removing private-key generator from IBE
- Structure-aware private set intersection, with applications to fuzzy matching
- Trapdoor hash functions and their applications
Cited in
(3)
This page was built for publication: Laconic branching programs from the Diffie-Hellman assumption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6635828)