Interactive Hashing: An Information Theoretic Tool (Invited Talk)

DOI10.1007/978-3-540-85093-9_3zbMath1162.94324OpenAlexW1531787749MaRDI QIDQ5502788

Joe Kilian, Claude Crépeau, George Savvides

Publication date: 9 January 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85093-9_3

Mathematics Subject Classification ID

Quantum computation (81P68) Cryptography (94A60) Information theory (general) (94A15)

Related Items

Bit Commitment in the Bounded Storage Model: Tight Bound and Simple Optimal Construction

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Constant-round oblivious transfer in the bounded storage model
• Perfect zero-knowledge arguments for NP using any one-way permutation
• Zero knowledge with efficient provers
• Information-Theoretic Interactive Hashing and Oblivious Transfer to a Storage-Bounded Receiver
• Optimal Reductions Between Oblivious Transfers Using Interactive Hashing
• Foundations of Cryptography
• Secure commitment against a powerful adversary
• Reducing Complexity Assumptions for Statistically-Hiding Commitment