Reducing complexity assumptions for statistically-hiding commitment

DOI10.1007/s00145-007-9012-8zbMath1173.94006OpenAlexW2097897004MaRDI QIDQ1027978

Iftach Haitner, Omer Horvitz, Ruggero Morselli, Chiu-Yuen Koo, Ronen Shaltiel, Jonathan N. Katz

Publication date: 30 June 2009

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-007-9012-8

zbMATH Keywords

bit commitmentregular one way functionsstatistical hiding

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)

Related Items (2)

Publicly-verifiable deletion via target-collapsing functions ⋮ A new interactive hashing theorem

Cites Work

• Bit commitment using pseudorandomness
• A discrete logarithm implementation of perfect zero-knowledge blobs
• Minimum disclosure proofs of knowledge
• On the power of two-point based sampling
• Perfect zero-knowledge arguments for NP using any one-way permutation
• Universal classes of hash functions
• Modern cryptography, probabilistic proofs and pseudo-randomness
• On the existence of statistically hiding bit commitment schemes and fail-stop signatures
• Parallel coin-tossing and constant-round secure two-party computation
• Necessary and sufficient conditions for collision-free hashing
• How to construct constant-round zero-knowledge proof systems for NP
• On the Cryptographic Applications of Random Functions (Extended Abstract)
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing
• A fast and simple randomized parallel algorithm for the maximal independent set problem
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• A Pseudorandom Generator from any One-way Function
• On the Existence of Pseudorandom Generators
• How to sign given any trapdoor permutation
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• Foundations of Cryptography
• A Parallel Repetition Theorem
• Foundations of Cryptography
• Secure commitment against a powerful adversary
• Reducing Complexity Assumptions for Statistically-Hiding Commitment
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Reducing complexity assumptions for statistically-hiding commitment