How to Generate and Use Universal Samplers
From MaRDI portal
Recommendations
- Universal samplers with fast verification
- scientific article; zbMATH DE number 7709346
- Universal sampling discretization
- A sample of samplers: a computational perspective on sampling
- How to generate uniform samples on discrete sets using the splitting method
- scientific article; zbMATH DE number 7650126
- Ewens sampling and invariable generation
- A consistent and stable approach to generalized sampling
- A Fresh Look at Generalized Sampling
Cites work
- scientific article; zbMATH DE number 1942416 (Why is no real title available?)
- scientific article; zbMATH DE number 2009971 (Why is no real title available?)
- scientific article; zbMATH DE number 1842483 (Why is no real title available?)
- scientific article; zbMATH DE number 1842494 (Why is no real title available?)
- A forward-secure public-key encryption scheme
- Adaptively secure, universally composable, multiparty computation in constant rounds
- Batch verification of short signatures
- Breaking the sub-exponential barrier in obfustopia
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Constrained pseudorandom functions and their applications
- Designing proof of human-work puzzles for cryptocurrency and beyond
- Efficient selective identity-based encryption without random oracles
- Functional signatures and pseudorandom functions
- How to use indistinguishability obfuscation
- Instantiating random oracles via UCEs
- Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation
- On Best-Possible Obfuscation
- On extractability obfuscation
- The exact security of digital signatures -- how to sign with RSA and Rabin
- The generic transformation from standard signatures to identity-based aggregate signatures
- The random oracle methodology, revisited.
- Two-round secure MPC from indistinguishability obfuscation
- Universal signature aggregators
Cited in
(27)- Non-interactive key exchange: new notions, new constructions, and forward security
- Indistinguishability obfuscation from well-founded assumptions
- The magic of ELFs
- Cryptography from planted graphs: security with logarithmic-size messages
- Designing proof of human-work puzzles for cryptocurrency and beyond
- Universal samplers with fast verification
- How to avoid obfuscation using witness PRFs
- Breaking the sub-exponential barrier in obfustopia
- Better two-round adaptive multi-party computation
- How to sample a discrete Gaussian (and more) from a random oracle
- Decomposable obfuscation: a framework for building applications of obfuscation from polynomial hardness
- Security-preserving distributed samplers: how to generate any CRS in one round without random oracles
- Adaptively secure streaming functional encryption
- Fast and Adaptively Secure Signatures in the Random Oracle Model from Indistinguishability Obfuscation (Short Paper)
- Adaptive multiparty NIKE
- Distributed (correlation) samplers: how to remove a trusted dealer in one round
- The Magic of ELFs
- Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification
- Lattice-based post-quantum iO from circular security with random opening assumption
- On deniable authentication against malicious verifiers
- Obfustopia built on secret-key functional encryption
- Witness semantic security
- Obfuscation combiners
- A unified approach to idealized model separations via indistinguishability obfuscation
- Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation
- Generic anamorphic encryption, revisited: new limitations and constructions
- Constrained pseudorandom functions from functional encryption
This page was built for publication: How to Generate and Use Universal Samplers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2953794)
