Bounds on the efficiency of black-box commitment schemes

DOI10.1016/j.tcs.2009.10.021zbMath1187.68206OpenAlexW2124195304MaRDI QIDQ2268099

Omer Horvitz, Jonathan N. Katz

Publication date: 10 March 2010

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.10.021

zbMATH Keywords

cryptographycommitment schemes

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bit commitment using pseudorandomness
• Probabilistic encryption
• Universal classes of hash functions
• On the Cryptographic Applications of Random Functions (Extended Abstract)
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• Coin flipping by telephone a protocol for solving impossible problems
• A Pseudorandom Generator from any One-way Function
• Foundations of Cryptography
• Nonmalleable Cryptography
• Bounds on the Efficiency of Generic Cryptographic Constructions
• Theory of Cryptography

This page was built for publication: Bounds on the efficiency of black-box commitment schemes