Bounds on the efficiency of black-box commitment schemes

DOI10.1016/J.TCS.2009.10.021MaRDI QIDQ2268099zbMATH OpenOpenAlexFDO

Authors Omer Horvitz, Jonathan 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

commitment schemescryptography

Mathematics Subject Classification ID

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

Recommendations

• Automata, Languages and Programming
• Round-Optimal Black-Box Statistically Binding Selective-Opening Secure Commitments
• (Nearly) round-optimal black-box constructions of commitments secure against selective opening attacks
• Black-box constructions of bounded-concurrent secure computation
• Efficiency Bounds for Adversary Constructions in Black-Box Reductions
• Black-box constructions of protocols for secure computation
• Round-optimal black-box commit-and-prove with succinct communication
• Black-box proof of knowledge of plaintext and multiparty computation with low communication overhead
• Black-box non-interactive non-malleable commitments

Cites work

• A Pseudorandom Generator from any One-way Function
• Bit commitment using pseudorandomness
• Bounds on the Efficiency of Generic Cryptographic Constructions
• Coin flipping by telephone a protocol for solving impossible problems
• Foundations of Cryptography
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• scientific article; zbMATH DE number 3960854 (Why is no real title available?)
• scientific article; zbMATH DE number 176554 (Why is no real title available?)
• scientific article; zbMATH DE number 1303133 (Why is no real title available?)
• scientific article; zbMATH DE number 2079922 (Why is no real title available?)
• scientific article; zbMATH DE number 4185033 (Why is no real title available?)
• Nonmalleable Cryptography
• On the Cryptographic Applications of Random Functions (Extended Abstract)
• Probabilistic encryption
• Theory of Cryptography
• Universal classes of hash functions

Cited in

(6)

• Round-Optimal Black-Box Statistically Binding Selective-Opening Secure Commitments
• Towards non-black-box lower bounds in cryptography
• Lower bounds on the efficiency of encryption and digital signature schemes
• Bounds on the Efficiency of Generic Cryptographic Constructions
• Automata, Languages and Programming
• Black-box anonymous commit-and-prove

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2268099)