Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function

DOI10.1137/080725404zbMath1195.94057OpenAlexW2018272912MaRDI 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

zbMATH Keywords

cryptographyone-way functionsstatistical zero-knowledge argument systemsstatistically hiding commitments

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (30)

Constant-round leakage-resilient zero-knowledge from collision resistance ⋮ 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 ⋮ PKP-based signature scheme ⋮ Oblivious Transfer from Weakly Random Self-Reducible Public-Key Cryptosystem ⋮ Message-Restriction-Free Commitment Scheme Based on Lattice Assumption ⋮ Statistical concurrent non-malleable zero-knowledge from one-way functions ⋮ 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 ⋮ Which languages have 4-round zero-knowledge proofs? ⋮ Constant-round adaptive zero-knowledge proofs for NP ⋮ An Almost-Optimally Fair Three-Party Coin-Flipping Protocol ⋮ Concurrent non-malleable statistically hiding commitment ⋮ A new interactive hashing theorem ⋮ Concurrent zero knowledge, revisited ⋮ Partial Bits Exposure Attacks on a New Commitment Scheme Based on the Zagier Polynomial ⋮ Grid-Obstacle Representations with Connections to Staircase Guarding ⋮ Quantum Commitments from Complexity Assumptions ⋮ 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? ⋮ An Equivalence Between Zero Knowledge and Commitments ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments ⋮ The Many Entropies in One-Way Functions ⋮ Quantum commitments from complexity assumptions

This page was built for publication: Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function