Derandomization in Cryptography

DOI10.1137/050641958MaRDI QIDQ5386205zbMATH OpenOpenAlexFDO

Authors Boaz Barak, Shien Jin Ong, Salil Vadhan

Publication date 22 April 2008

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL http://nrs.harvard.edu/urn-3:HUL.InstRepos:41467486

zbMATH Keywords

commitment schemescomplexity theoryinteractive proofspseudorandom generatorswitness-indistinguishable proofs

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Applications to coding theory and cryptography of arithmetic geometry (14G50) Theory of computing (68Q99) Cryptography (94A60)

Recommendations

• Advances in Cryptology - CRYPTO 2003
• scientific article; zbMATH DE number 2019634
• Cryptography in NC^0
• Hardness vs randomness
• An efficient noninteractive zero-knowledge proof system for NP with general assumptions

Cited in

(32)

• One-message zero knowledge and non-malleable commitments
• Black-box non-interactive non-malleable commitments
• Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments
• New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust
• Non-malleable codes for bounded parallel-time tampering
• A note on perfect correctness by derandomization
• COA-secure obfuscation and applications
• On beating the hybrid argument
• Verifiable functional encryption
• Incompressible functions, relative-error extractors, and the power of nondeterministic reductions
• Digit Set Randomization in Elliptic Curve Cryptography
• Which languages have 4-round zero-knowledge proofs?
• The journey from NP to TFNP hardness
• Random Sources for Cryptographic Systems
• Weak Zero-Knowledge beyond the Black-Box Barrier
• A note on perfect correctness by derandomization
• Advances in Cryptology - CRYPTO 2003
• scientific article; zbMATH DE number 4187086 (Why is no real title available?)
• Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?
• Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?
• Verifiable random functions from non-interactive witness-indistinguishable proofs
• The communication complexity of private simultaneous messages, revisited
• On non-uniform security for black-box non-interactive CCA commitments
• Statistically sender-private OT from LPN and derandomization
• More efficient verifiable functional encryption
• Robust Distributed Pseudorandom Functions for mNP Access Structures
• Nearly optimal pseudorandomness from hardness
• Non-malleable codes with optimal rate for poly-size circuits
• Communication complexity vs randomness complexity in interactive proofs
• Stretching demi-bits and nondeterministic-secure pseudorandomness
• Private PAC learning may be harder than online learning
• Cryptography in the multi-string model

This page was built for publication: Derandomization in Cryptography

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5386205)