Universal Samplers with Fast Verification
From MaRDI portal
Publication:5738767
DOI10.1007/978-3-662-54388-7_18zbMath1400.94160OpenAlexW2584605223MaRDI QIDQ5738767
Brent Waters, Venkata Koppula, Andrew Poelstra
Publication date: 13 June 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-54388-7_18
Cites Work
- Unnamed Item
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Efficient Secure Two-Party Computation Using Symmetric Cut-and-Choose
- Constrained Pseudorandom Functions and Their Applications
- Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation
- Universal Signature Aggregators
- How to Obfuscate Programs Directly
- How to Generate and Use Universal Samplers
- A Punctured Programming Approach to Adaptively Secure Functional Encryption
- How to use indistinguishability obfuscation
- Obfuscating Circuits via Composite-Order Graded Encoding
- Functional Signatures and Pseudorandom Functions
This page was built for publication: Universal Samplers with Fast Verification
