Cryptographic protocols with everyday objects-Reference-Cited by-同舟云学术

Cryptographic protocols with everyday objects

Published:2014-01 Issue:1 Volume:26 Page:37-62
ISSN:0934-5043
Container-title:Formal Aspects of Computing
language:en
Short-container-title:Form. Asp. Comput.

Author:

Heather James¹,Schneider Steve¹,Teague Vanessa²

Affiliation:

1. Department of Computing, University of Surrey, Guildford, GU2 7XH, Surrey, UK

2. Department of Computer Science and Software Engineering, University of Melbourne, Melbourne, Australia

Abstract

Abstract Most security protocols appearing in the literature make use of cryptographic primitives that assume that the participants have access to some sort of computational device. However, there are times when there is need for a security mechanism to evaluate some result without leaking sensitive information, but computational devices are unavailable. We discuss here various protocols for solving cryptographic problems using everyday objects: coins, dice, cards, and envelopes.

Publisher

Association for Computing Machinery (ACM)

Subject

Theoretical Computer Science,Software

Link

http://link.springer.com/content/pdf/10.1007/s00165-013-0274-7.pdf

Reference15 articles.

1. The dining cryptographers problem: Unconditional sender and recipient untraceability

2. A public key cryptosystem and a signature scheme based on discrete logarithms

3. Formal Systems (Europe) Ltd (1997) Failures-divergence refinement—FDR 2 user manual. Formal Systems’ web site. http://www.formal.demon.co.uk/FDR2.html

4. Goldsmith M Whittaker P (2005) A CSP frontend for probabilistic tools. Technical report The FORWARD project June 2005. http://forward-project.org.uk/PDF_Files/D14.pdf. Accessed 14 Aug 2012

5. Comparing BDD and SAT based techniques for model checking Chaum’s dining cryptographers protocol;Kacprzak M;Fundam Inf,2006

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Efficient Card-Based Protocols for Symmetric Functions Using Four-Colored Decks;Proceedings of the 11th ACM Asia Public-Key Cryptography Workshop;2024-07

2. Card-Based Overwriting Protocol for Equality Function and Applications;Lecture Notes in Computer Science;2024

3. Relationship between AND extension and XOR extension of 3-valued input with 2-party card-based protocols;2023 IEEE International Conference on Consumer Electronics-Asia (ICCE-Asia);2023-10-23

4. Few-helping-card Protocols for Some Wider Class of Symmetric Boolean Functions with Arbitrary Ranges;Proceedings of the 10th ACM Asia Public-Key Cryptography Workshop;2023-07-10

5. Single-Shuffle Card-Based Protocol with Eight Cards per Gate;Unconventional Computation and Natural Computation;2023