How to Generate and Use Universal Samplers

DOI10.1007/978-3-662-53890-6_24zbMath1407.94121OpenAlexW2550653362MaRDI QIDQ2953794

Dakshita Khurana, Dennis Hofheinz, Amit Sahai, Mark Zhandry, Tibor Jager, Brent Waters

Publication date: 6 January 2017

Published in: Advances in Cryptology – ASIACRYPT 2016 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-53890-6_24

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (18)

Fast and Adaptively Secure Signatures in the Random Oracle Model from Indistinguishability Obfuscation (Short Paper) ⋮ Designing Proof of Human-Work Puzzles for Cryptocurrency and Beyond ⋮ Distributed (correlation) samplers: how to remove a trusted dealer in one round ⋮ Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation ⋮ Adaptive multiparty NIKE ⋮ How to sample a discrete Gaussian (and more) from a random oracle ⋮ Better Two-Round Adaptive Multi-party Computation ⋮ Universal Samplers with Fast Verification ⋮ Decomposable obfuscation: a framework for building applications of obfuscation from polynomial hardness ⋮ Obfustopia built on secret-key functional encryption ⋮ How to Avoid Obfuscation Using Witness PRFs ⋮ Constrained pseudorandom functions from functional encryption ⋮ Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification ⋮ A Unified Approach to Idealized Model Separations via Indistinguishability Obfuscation ⋮ Obfuscation Combiners ⋮ The magic of ELFs ⋮ The Magic of ELFs ⋮ Breaking the Sub-Exponential Barrier in Obfustopia

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient selective identity-based encryption without random oracles
• The generic transformation from standard signatures to identity-based aggregate signatures
• Batch verification of short signatures
• A forward-secure public-key encryption scheme
• Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
• Instantiating Random Oracles via UCEs
• Constrained Pseudorandom Functions and Their Applications
• Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation
• The Exact Security of Digital Signatures-How to Sign with RSA and Rabin
• Universal Signature Aggregators
• The random oracle methodology, revisited
• Designing Proof of Human-Work Puzzles for Cryptocurrency and Beyond
• On Best-Possible Obfuscation
• How to use indistinguishability obfuscation
• Adaptively Secure, Universally Composable, Multiparty Computation in Constant Rounds
• Breaking the Sub-Exponential Barrier in Obfustopia
• Functional Signatures and Pseudorandom Functions
• On Extractability Obfuscation
• Two-Round Secure MPC from Indistinguishability Obfuscation

This page was built for publication: How to Generate and Use Universal Samplers