(Enter summary)
Abstract: In this paper we attempt to formally study two very intuitive
physical models: sealed envelopes and locked boxes, often used as
illustrations for common cryptographic operations. We relax the security
properties usually required from locked boxes (such as in bit-commitment
protocols) and require only that a broken lock or torn envelope be identifiable
to the original sender. Unlike the completely impregnable locked
box, this functionality may be achievable in real life, where containers... (Update)
Cited by: More
Cryptography from Anonymity - Yuval Ishai Eyal
(Correct)
Active bibliography (related documents): More All
0.5: Cryptography in the Bounded Quantum-Storage Model - Damgård, Fehr.. (2005)
(Correct)
0.3: On Security of Sublinear Oblivious Transfer - Laur, Lipmaa (2006)
(Correct)
0.3: Fuzzy Extractors: How to Generate Strong Keys from.. - Dodis, Reyzin, Smith (2004)
(Correct)
Similar documents based on text: More All
0.2: Adaptively Secure Multi-party Computation - Canetti, Feige, Goldreich, Naor (1995)
(Correct)
0.2: The Round-Complexity of Black-Box Concurrent Zero-Knowledge - Rosen (2003)
(Correct)
0.2: Pseudo-Random Synthesizers, Functions and Permutations - Reingold (1998)
(Correct)
Related documents from co-citation: More All
2: An oblivious transfer protocol with log-squared communication
- Lipmaa - 2004
2: Secure Games with Polynomial Expressions
- Kiayias, Yung - 2001
2: Revealing information while preserving privacy (context) - Dinur, Nissim - 2003
BibTeX entry: (Update)
T. Moran and M. Naor. Basing Cryptographic Protocols on Tamper-Evident Seals. Proc. of ICALP 2005, pp. 285-297. http://citeseer.ist.psu.edu/moran05basing.html More
@misc{ moran05basing,
author = "T. Moran and M. Naor",
title = "Basing Cryptographic Protocols on Tamper-Evident Seals",
text = "T. Moran and M. Naor. Basing Cryptographic Protocols on Tamper-Evident
Seals. Proc. of ICALP 2005, pp. 285-297.",
year = "2005",
url = "citeseer.ist.psu.edu/moran05basing.html" }
Citations (may not include all citations):
194
Proofs that yield nothing but their validity or all language.. (context) - Goldreich, Micali et al. - 1991
189
Universally composable security: A new paradigm for cryptogr..
- Canetti - 2000
94
Security Engineering: A Guide to Building Dependable Distrib.. (context) - Anderson - 2001
79
One-way functions are essential for complexity based cryptog.. (context) - Impagliazzo, Luby - 1989
41
Unconditionally secure quantum bit commitment is impossible (context) - Mayers - 1997
30
Comparing information without leaking it
- Fagin, Naor et al. - 1996
25
Why quantum bit commitment and ideal quantum coin tossing ar.. (context) - Lo, Chau - 1998
18
Achieving oblivious transfer using weakened security assumpt.. (context) - Crepeau, Kilian - 1988
18
Limits on the security of coin flips when half the processor.. (context) - Cleve - 1986
13
possibility of basing oblivious transfer and bit commitment .. (context) - Damgard, Kilian et al. - 1999
9
Coin flipping over the telephone (context) - Blum - 1982
6
Quantum bit escrow
- Aharonov, Ta-Shma et al. - 2000
5
The solitaire encryption algorithm (context) - Schneier - 1999
3
cient cryptographic protocols based on noisy channels (context) - Crepeau - 1997
3
Cryptographic randomized response techniques
- Ambainis, Jakobsson et al. - 2004
2
Unfair noisy channels and oblivious transfer (context) - Damgard, Fehr et al. - 2004
1
Cryptology and physical security: Rights amplification in ma..
- Blaze - 2003
1
collective coin flipping and discrete control processes (context) - Cleve, Impagliazzo - 1993
1
Penn CIS Department Technical Report (context) - Blaze, the - 2004
1
Applied kid cryptography or how to convince your children yo..
- Naor, Naor et al. - 1999
Documents on the same site (http://www.wisdom.weizmann.ac.il/~talm/):
Non-Interactive Timestamping in the Bounded Storage Model - Moran, Shaltiel, Ta-Shma (2004)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC