Limits on the security of coin flips when half the processors are faulty
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
Comparing information without leaking it
Communications of the ACM
Why quantum bit commitment and ideal quantum coin tossing are impossible
PhysComp96 Proceedings of the fourth workshop on Physics and computation
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Security Engineering: A Guide to Building Dependable Distributed Systems
Security Engineering: A Guide to Building Dependable Distributed Systems
In Code: A Mathematical Journey
In Code: A Mathematical Journey
Rights Amplification in Master-Keyed Mechanical Locks
IEEE Security and Privacy
Achieving oblivious transfer using weakened security assumptions
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
One-way functions are essential for complexity based cryptography
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Efficient cryptographic protocols based on noisy channels
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Split-ballot voting: everlasting privacy with distributed trust
Proceedings of the 14th ACM conference on Computer and communications security
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Six-Card Secure AND and Four-Card Secure XOR
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Cryptographic and physical zero-knowledge proof systems for solutions of sudoku puzzles
FUN'07 Proceedings of the 4th international conference on Fun with algorithms
Secure multiparty computations using a dial lock
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Secure multiparty computations using the 15 puzzle
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
David and Goliath commitments: UC computation for asymmetric parties using tamper-proof hardware
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
Cryptographic and physical zero-knowledge proof: from Sudoku to nonogram
FUN'10 Proceedings of the 5th international conference on Fun with algorithms
Founding cryptography on tamper-proof hardware tokens
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Polling with physical envelopes: a rigorous analysis of a human-centric protocol
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Single layer optical-scan voting with fully distributed trust
VoteID'11 Proceedings of the Third international conference on E-Voting and Identity
Several weak bit-commitments using seal-once tamper-evident devices
ProvSec'12 Proceedings of the 6th international conference on Provable Security
| Hi-index | 0.00 |
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 having this property are called “tamper-evident seals”. Another physical object with this property is the “scratch-off card”, often used in lottery tickets. We show that scratch-off cards can be used to implement bit-commitment and coin flipping, but not oblivious transfer. Of particular interest, we give a strongly-fair coin flipping protocol with bias bounded by O(1/r) (where r is the number of rounds), beating the best known bias in the standard model even with cryptographic assumptions.