Basing cryptographic protocols on tamper-evident seals

DOI10.1016/J.TCS.2009.10.023zbMath1187.68211OpenAlexW1999900367MaRDI QIDQ2268101

Moni Naor, Tal Moran

Publication date: 10 March 2010

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.10.023

zbMATH Keywords

humanprotocolcoin flippingtamper-evident sealsuniversally composable

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25)

Related Items (7)

How to construct physical zero-knowledge proofs for puzzles with a ``single loop condition ⋮ Another step towards realizing random oracles: non-malleable point obfuscation ⋮ Unclonable polymers and their cryptographic applications ⋮ Secure Two-Party Computation: A Visual Way ⋮ Card-minimal protocols for symmetric Boolean functions of more than seven inputs ⋮ Hide a liar: card-based ZKP protocol for Usowan ⋮ Secure computation without computers

Cites Work

• Unnamed Item
• Unnamed Item
• Synthesizers and their application to the parallel construction of pseudo-random functions
• Why quantum bit commitment and ideal quantum coin tossing are impossible.
• Quantum bit escrow
• Polling with Physical Envelopes: A Rigorous Analysis of a Human-Centric Protocol
• An Optimally Fair Coin Toss
• On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• Theory of Cryptography
• Public Key Cryptography – PKC 2004

This page was built for publication: Basing cryptographic protocols on tamper-evident seals