Basing cryptographic protocols on tamper-Evident seals

Lecture Notes in Computer Science

Volumn 3580, Issue , 2005, Pages 285-297

  Moran, Tal ^a   Naor, Moni ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; SEALS; SECURITY OF DATA;

BIT-COMMITMENT PROTOCOLS; CRYPTOGRAPHIC PROTOCOLS; FUNCTIONALITY; TAMPER-EVIDENT SEALS;

NETWORK PROTOCOLS;

EID: 26444553313     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11523468_24     Document Type: Conference Paper

References (21)

1. D. Aharonov, A. Ta-Shma, U. V. Vazirani, and A. C. Yao. Quantum bit escrow. In STOC '00, pages 705-714, 2000.
2. A. Ambainis, M. Jakobsson, and H. Lipmaa. Cryptographic randomized response techniques. In PKC '04, volume 2947 of LNCS, pages 425-438, 2004.
3. R. J. Anderson. Security Engineering: A Guide to Building Dependable Distributed Systems. John Wiley & Sons, Inc., 2001.
4. M. Blaze. Cryptology and physical security: Rights amplification in master-keyed mechanical locks. IEEE Security and Privacy, March 2003.
5. M. Blaze. Safecracking for the computer scientist. U. Penn CIS Department Technical Report, December 2004. http://www.crypto.com/papers/safelocks.pdf.
6. M. Blum. Coin flipping over the telephone. In Proceedings of IEEE COMPCON '82, pages 133-137, 1982.
7. R. Canetti. Universally composable security: A new paradigm for cryptographic protocols. Cryptology ePrint Archive, Report 2000/067, 2000.
8. R. Cleve. Limits on the security of coin flips when half the processors are faulty. In STOC '86, pages 364-369, 1986.
9. R. Cleve and R. Impagliazzo. Martingales, collective coin flipping and discrete control processes, http://www.cpsc.ucalgary.ca/cleve/pubs/martingales. ps, 1993.
10. C. Crépeau. Efficient cryptographic protocols based on noisy channels. In Eurocrypt '97, volume 1233 of LNCS, pages 306-317, 1997.
11. C. Crépeau and J. Kilian. Achieving oblivious transfer using weakened security assumptions. In FOCS '88, pages 42-52, 1988.
12. I. B. Damgård, S. Fehr, K. Morozov, and L. Salvail. Unfair noisy channels and oblivious transfer. In TCC '04, volume 2951 of LNCS, pages 355-373, 2004.
13. I. B. Damgård, J. Kilian, and L. Salvail. On the (im)possibility of basing oblivious transfer and bit commitment on weakened security assumptions. In Eurocrypt '99, volume 1592 of LNCS, pages 56-73, 1999.
14. R. Fagin, M. Naor, and P. Winkler. Comparing information without leaking it. Commun. ACM, 39(5):77-85, 1996.
15. S. Flannery and D. Flannery. In Code: A Mathematical Journey. Algonquin Books of Chapel Hill, 2002.
16. O. Goldreich, S. Micali, and A. Wigderson. Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems. J. of the ACM, 38(3):691-729, July 1991.
17. R. Impagliazzo and M. Luby. One-way functions are essential for complexity based cryptography. In FOCS '89, pages 230-235, 1989.
18. H.-K. Lo and H. F. Chau. Why quantum bit commitment and ideal quantum coin tossing are impossible. In PhysComp '98, pages 177-187, 1998.
19. D. Mayers. Unconditionally secure quantum bit commitment is impossible. Phys. Rev. Lett., (78):3414-3417, 1997.
20. M. Naor, Y. Naor, and O. Reingold. Applied kid cryptography or how to convince your children you are not cheating, Mar. 1999. http://www.wisdom. weizmann.ac.il/naor/PAPERS/waldo.ps.
21. B. Schneier. The solitaire encryption algorithm, 1999. http://www.schneier.com/solitaire.html.