Secure commitment against a powerful adversary

DOI10.1007/3-540-55210-3_203MaRDI QIDQ5096801zbMATH OpenOpenAlexFDO

Authors Rafail Ostrovsky, Ramarathnam Venkatesan, Moti 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)

Cites work

• Algebraic methods for interactive proof systems
• Average Case Complete Problems
• Average case completeness
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• scientific article; zbMATH DE number 549858 (Why is no real title available?)
• scientific article; zbMATH DE number 708806 (Why is no real title available?)
• scientific article; zbMATH DE number 4185033 (Why is no real title available?)
• Minimum disclosure proofs of knowledge
• On hiding information from an oracle
• The knowledge complexity of interactive proof-systems

Cited in

(6)

• Reducing complexity assumptions for statistically-hiding commitment
• Efficient commitment schemes with bounded sender and unbounded receiver
• Attacks on the basic cMix design: on the necessity of commitments and randomized partial checking
• A new interactive hashing theorem
• Interactive Hashing: An Information Theoretic Tool (Invited Talk)
• A language-dependent cryptographic primitive

This page was built for publication: Secure commitment against a powerful adversary

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