Reducing complexity assumptions for statistically-hiding commitment
type: Item
instance of: scholarly article
title: Reducing complexity assumptions for statistically-hiding commitment
zbMATH Open document ID: 1173.94006
author: Iftach Haitner
author: Omer Horvitz
author: Chiu-Yuen Koo
author: Ruggero Morselli
author: Ronen Shaltiel
author: Jonathan Katz
published in: Journal of Cryptology
publication date: 2009-06-30T00:00:00Z
review text: \textit{M. Naor} et al. [J. Cryptology 11, No. 2, 87--108 (1998; Zbl 0960.94016)] have shown how to construct statistically-hiding commitment schemes based on any one-way permutation. This paper discusses the construction with one-way functions for which the value of pre-images each of the outputs can be efficiently estimated. A special case is the class of regular one-way functions where all points in the image of the function have the same number of pre-images.
reviewed by: Jerzy Żurawiecki
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 94A62
Mathematics Subject Classification ID: 68P25
zbMATH DE Number: 5571751
zbMATH Keywords: bit commitment
zbMATH Keywords: statistical hiding
zbMATH Keywords: regular one way functions
MaRDI profile type: Publication
full work available at URL: s00145-007-9012-8
OpenAlex ID: W2097897004
cites work: A fast and simple randomized parallel algorithm for the maximal independent set problem
cites work: How to sign given any trapdoor permutation
cites work: How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
cites work: A discrete logarithm implementation of perfect zero-knowledge blobs
cites work: Minimum disclosure proofs of knowledge
cites work: Universal classes of hash functions
cites work: On the power of two-point based sampling
cites work: Q3792624
cites work: On the existence of statistically hiding bit commitment schemes and fail-stop signatures
cites work: Q4036897
cites work: Modern cryptography, probabilistic proofs and pseudo-randomness
cites work: Foundations of Cryptography
cites work: How to construct constant-round zero-knowledge proof systems for NP
cites work: On the Cryptographic Applications of Random Functions (Extended Abstract)
cites work: Q3729902
cites work: Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
cites work: On the Existence of Pseudorandom Generators
cites work: A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
cites work: Q3549591
cites work: Reducing Complexity Assumptions for Statistically-Hiding Commitment
cites work: Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing
cites work: A Pseudorandom Generator from any One-way Function
cites work: Q5750403
cites work: Parallel coin-tossing and constant-round secure two-party computation
cites work: Bit commitment using pseudorandomness
cites work: Perfect zero-knowledge arguments for NP using any one-way permutation
cites work: Secure commitment against a powerful adversary
cites work: Q4858457
cites work: A Parallel Repetition Theorem
cites work: Necessary and sufficient conditions for collision-free hashing
DOI: 10.1007/S00145-007-9012-8
Recommended article: Reducing Complexity Assumptions for Statistically-Hiding Commitment
Recommended article: Q3549591
Recommended article: Reducing Complexity Assumptions for Oblivious Transfer
Recommended article: Concurrent non-malleable statistically hiding commitment
Recommended article: Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function
Recommended article: Somewhere statistically binding commitment schemes with applications
Recommended article: Non-malleable Statistically Hiding Commitment from Any One-Way Function
Recommended article: Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments
Recommended article: On the existence of statistically hiding bit commitment schemes and fail-stop signatures
Recommended article: Q4341752
description: scientific article; zbMATH DE number 5571751