Rate-1 fully local somewhere extractable hashing from DDH
From MaRDI portal
Publication:6635830
DOI10.1007/978-3-031-57725-3_12MaRDI QIDQ6635830
Nico Döttling, Akshayaram Srinivasan, Riccardo Zanotto, Pedro Branco
Publication date: 12 November 2024
Cites Work
- A simple construction of iO for Turing machines
- Succinct garbling schemes from functional encryption through a local simulation paradigm
- Identity-based encryption from the Diffie-Hellman assumption
- Laconic oblivious transfer and its applications
- Constant ciphertext-rate non-committing encryption from standard assumptions
- Non-interactive batch arguments for NP from standard assumptions
- SNARGs for P from sub-exponential DDH and QR
- Trapdoor hash functions and their applications
- Somewhere statistical soundness, post-quantum security, and SNARGs
- New Realizations of Somewhere Statistically Binding Hashing and Positional Accumulators
- Breaking the Circuit Size Barrier for Secure Computation Under DDH
- Indistinguishability Obfuscation for Turing Machines with Unbounded Memory
- On the Communication Complexity of Secure Function Evaluation with Long Output
- Non-interactive delegation and batch NP verification from standard computational assumptions
- On lattices, learning with errors, random linear codes, and cryptography
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
- Correlation intractability and SNARGs from sub-exponential DDH
- Boosting batch arguments and RAM delegation
This page was built for publication: Rate-1 fully local somewhere extractable hashing from DDH
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6635830)
