Secure commitment against a powerful adversary

DOI10.1007/3-540-55210-3_203zbMath1494.94041OpenAlexW1596546325MaRDI QIDQ5096801

Ramarathnam Venkatesan, Rafail Ostrovsky, Mordechai M. Yung

Publication date: 18 August 2022

Published in: STACS 92 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-55210-3_203

Mathematics Subject Classification ID

Applications of game theory (91A80) Cryptography (94A60)

Related Items

A new interactive hashing theorem ⋮ A language-dependent cryptographic primitive ⋮ Reducing complexity assumptions for statistically-hiding commitment ⋮ Interactive Hashing: An Information Theoretic Tool (Invited Talk)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimum disclosure proofs of knowledge
• Average case completeness
• On hiding information from an oracle
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• Average Case Complete Problems
• Algebraic methods for interactive proof systems
• The knowledge complexity of interactive proof-systems