Results 1 to 10 of about 1,830,452 (350)
A Rational Approach to Cryptographic Protocols [PDF]
Mathematical and Computer Modelling. Volume 46, Issues 1-2, July
2007, Pages 80-87., 2010 This work initiates an analysis of several cryptographic protocols from a rational point of view using a game-theoretical approach, which allows us to represent not only the protocols but also possible misbehaviours of parties. Concretely, several concepts of two-person games and of two-party cryptographic protocols are here combined in order to model ...
Pino Caballero‐Gil +2 more
arxiv +7 more sources
Multiparty quantum cryptographic protocol [PDF]
Chinese Physics Letters, 2009 We propose a multiparty quantum cryptographic protocol. Unitary operators applied by Bob and Charlie, on their respective qubits of a tripartite entangled state encodes a classical symbol that can be decoded at Alice's end with the help of a decoding ...
Beige A +16 more
core +5 more sources
Nonmonotonic cryptographic protocols. [PDF]
Proceedings The Computer Security Foundations Workshop VII, 1994 The paper presents a new method for specifying and analyzing cryptographic protocols. The method offers several advantages over previous approaches. The technique is the first to allow reasoning about nonmonotonic protocols, which are needed for systems that rely on the deletion of information.
Aviel D. Rubin
+5 more sources
A Calculus for Cryptographic Protocols: The Spi Calculus [PDF]
Information and Computation, 1999 AbstractWe introduce the spi calculus, an extension of the pi calculus designed for describing and analyzing cryptographic protocols. We show how to use the spi calculus, particularly for studying authentication protocols. The pi calculus (without extension) suffices for some abstract protocols; the spi calculus enables us to consider cryptographic ...
Martı́n Abadi, Andrew D. Gordon
openalex +3 more sources
Quantum cryptographic three party protocols [PDF]
arXiv, 2000 Due to the impossibility results of Mayers and Lo/Chau it is generally thought that a quantum channel is cryptographically strictly weaker than oblivious transfer. In this paper we prove that in a three party scenario a quantum channel can be strictly stronger than oblivious transfer.
Joern Mueller-Quade, Hiroyuki Imai
arxiv +3 more sources
A Cryptographic Moving-Knife Cake-Cutting Protocol [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 This paper proposes a cake-cutting protocol using cryptography when the cake is a heterogeneous good that is represented by an interval on a real line. Although the Dubins-Spanier moving-knife protocol with one knife achieves simple fairness, all players
Yoshifumi Manabe, Tatsuaki Okamoto
doaj +4 more sources
Universally composable security: a new paradigm for cryptographic protocols [PDF]
Proceedings IEEE International Conference on Cluster Computing, 2001 We propose a novel paradigm for defining security of cryptographic protocols, called universally composable security. The salient property of universally composable definitions of security is that they guarantee security even when a secure protocol is ...
Ran Canetti
openalex +2 more sources
The Inductive Approach to Verifying Cryptographic Protocols [PDF]
Journal of Computer Security, 2021 Informal arguments that cryptographic protocols are secure can be made rigorous using inductive definitions. The approach is based on ordinary predicate calculus and copes with infinite-state systems. Proofs are generated using Isabelle/HOL.
Lawrence Charles Paulson
semanticscholar +5 more sources
Secure quantum channels with correlated twin laser beams [PDF]
, 2004 This work is the development and analysis of the recently proposed quantum cryptographic protocol, based on the use of the two-mode coherently correlated states. The protocol is supplied with the cryptographic control procedures. The quantum noise influence on the channel error properties is examined. State detection features are proposed.
A. Ekert +10 more
arxiv +3 more sources
Is it possible to decide whether a cryptographic protocol is secure or not?
Journal of Telecommunications and Information Technology, 2002 We consider the so called ``cryptographic protocols`` whose aim is to ensure some security properties when communication channels are not reliable. Such protocols usually rely on cryptographic primitives.
Hubert Comon, Vitaly Shmatikov
doaj +2 more sources