Bit Commitment in the Bounded Storage Model: Tight Bound and Simple Optimal Construction
From MaRDI portal
Publication:3104689
DOI10.1007/978-3-642-25516-8_8zbMath1292.68063OpenAlexW124219044MaRDI QIDQ3104689
Junji Shikata, Daisuke Yamanaka
Publication date: 16 December 2011
Published in: Cryptography and Coding (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-25516-8_8
Cryptography (94A60) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bit commitment using pseudorandomness
- Constant-round oblivious transfer in the bounded storage model
- Information-theoretic bounds for authentication schemes
- Perfect zero-knowledge arguments for NP using any one-way permutation
- Conditionally-perfect secrecy and a provably-secure randomized cipher
- A lower bound on authentication after having observed a sequence of messages
- Oblivious transfer and privacy amplification
- Randomness is linear in space
- Optimal Reductions Between Oblivious Transfers Using Interactive Hashing
- Information-Theoretic Conditions for Two-Party Secure Function Evaluation
- The Bare Bounded-Storage Model: The Tight Bound on the Storage Requirement for Key Agreement
- On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions
- Efficient Oblivious Transfer in the Bounded-Storage Model
- Authentication theory and hypothesis testing
- Everlasting security in the bounded storage model
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - CRYPTO 2003
- Interactive Hashing: An Information Theoretic Tool (Invited Talk)
- Oblivious Transfer and Linear Functions
This page was built for publication: Bit Commitment in the Bounded Storage Model: Tight Bound and Simple Optimal Construction
