Interactive Hashing: An Information Theoretic Tool (Invited Talk)
From MaRDI portal
Recommendations
- A new interactive hashing theorem
- Information-Theoretic Interactive Hashing and Oblivious Transfer to a Storage-Bounded Receiver
- New bounds for perfect hashing via information theory
- Optimal Reductions Between Oblivious Transfers Using Interactive Hashing
- scientific article; zbMATH DE number 1418345
- On probabilistic analysis of a coalesced hashing algorithm
Cites work
- scientific article; zbMATH DE number 549858 (Why is no real title available?)
- scientific article; zbMATH DE number 1842490 (Why is no real title available?)
- scientific article; zbMATH DE number 1394298 (Why is no real title available?)
- Constant-round oblivious transfer in the bounded storage model
- Foundations of Cryptography
- Information-Theoretic Interactive Hashing and Oblivious Transfer to a Storage-Bounded Receiver
- Optimal Reductions Between Oblivious Transfers Using Interactive Hashing
- Perfect zero-knowledge arguments for NP using any one-way permutation
- Reducing Complexity Assumptions for Statistically-Hiding Commitment
- Secure commitment against a powerful adversary
- Zero knowledge with efficient provers
Cited in
(3)
This page was built for publication: Interactive Hashing: An Information Theoretic Tool (Invited Talk)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5502788)
