Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function
From MaRDI portal
Publication:3575163
DOI10.1137/080725404zbMath1195.94057MaRDI QIDQ3575163
Omer Reingold, Minh-Huyen Nguyen, Shien Jin Ong, Iftach Haitner, Salil P. Vadhan
Publication date: 7 July 2010
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: http://nrs.harvard.edu/urn-3:HUL.InstRepos:14123818
cryptography; one-way functions; statistical zero-knowledge argument systems; statistically hiding commitments
11T71: Algebraic coding theory; cryptography (number-theoretic aspects)
94A60: Cryptography
68P25: Data encryption (aspects in computer science)
14G50: Applications to coding theory and cryptography of arithmetic geometry
Related Items
Grid-Obstacle Representations with Connections to Staircase Guarding, Unnamed Item, Unnamed Item, The Many Entropies in One-Way Functions, Message-Restriction-Free Commitment Scheme Based on Lattice Assumption, Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments, An Equivalence Between Zero Knowledge and Commitments, 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?, Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious, Statistical security in two-party computation revisited, Doubly adaptive zero-knowledge proofs, General properties of quantum bit commitments (extended abstract), Quantum computationally predicate-binding commitments with application in quantum zero-knowledge arguments for NP, Quantum commitments from complexity assumptions, Which languages have 4-round zero-knowledge proofs?, Concurrent non-malleable statistically hiding commitment, Constant-round adaptive zero-knowledge proofs for NP, Constant-round leakage-resilient zero-knowledge from collision resistance, PKP-based signature scheme, Statistical concurrent non-malleable zero-knowledge from one-way functions, A new interactive hashing theorem, Concurrent zero knowledge, revisited, Oblivious Transfer from Weakly Random Self-Reducible Public-Key Cryptosystem, An Almost-Optimally Fair Three-Party Coin-Flipping Protocol, Partial Bits Exposure Attacks on a New Commitment Scheme Based on the Zagier Polynomial, Quantum Commitments from Complexity Assumptions, Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious, Statistical Concurrent Non-malleable Zero-Knowledge from One-Way Functions, (Almost) Optimal Constructions of UOWHFs from 1-to-1, Regular One-Way Functions and Beyond
