Filters








1,379 Hits in 4.2 sec

On the Relative Soundness of the Free Algebra Model for Public Key Encryption

Christopher Lynch, Catherine Meadows
2005 Electronical Notes in Theoretical Computer Science  
In this paper, we show how Millen's approach can be extended to public key cryptography, giving conditions under which security for the free algebra model implies security for the rewrite rule model.  ...  But free algebras are more efficient, and appear to be sound for "most" protocols.  ...  Conclusions In this paper we extended Millen's result on the soundness of the free encryption model for shared key encryption to public key encryption as well.  ... 
doi:10.1016/j.entcs.2004.05.018 fatcat:tiunrucizzcu5pbtld3qhscs6m

Constraint solving for bounded-process cryptographic protocol analysis

Jonathan Millen, Vitaly Shmatikov
2001 Proceedings of the 8th ACM conference on Computer and Communications Security - CCS '01  
The reachability problem for cryptographic protocols with nonatomic keys can be solved via a simple constraint satisfaction procedure.  ...  Using the free term algebra simplifies the model, enabling us to handle constructed keys even in cases of self-encryption.  ...  The term algebra allows any term to be used as an encryption key both for public-key and symmetric encryption. We make, however, a (fairly realistic) assumption that private keys are never leaked.  ... 
doi:10.1145/501983.502007 dblp:conf/ccs/MillenS01 fatcat:osujqb2zuzf3fm2jncr6s2cuzq

Constraint solving for bounded-process cryptographic protocol analysis

Jonathan Millen, Vitaly Shmatikov
2001 Proceedings of the 8th ACM conference on Computer and Communications Security - CCS '01  
The reachability problem for cryptographic protocols with nonatomic keys can be solved via a simple constraint satisfaction procedure.  ...  Using the free term algebra simplifies the model, enabling us to handle constructed keys even in cases of self-encryption.  ...  The term algebra allows any term to be used as an encryption key both for public-key and symmetric encryption. We make, however, a (fairly realistic) assumption that private keys are never leaked.  ... 
doi:10.1145/502006.502007 fatcat:65qnw6cv2vabxco5xdsoymvw3m

Universally Composable Symbolic Analysis of Mutual Authentication and Key-Exchange Protocols [chapter]

Ran Canetti, Jonathan Herzog
2006 Lecture Notes in Computer Science  
We restrict attention to protocols that use public-key encryption as their only cryptographic primitive and have a specific restricted format.  ...  Following recent work on cryptographically sound symbolic analysis, we demonstrate how Dolev-Yao style symbolic analysis can be used to assert the security of cryptographic protocols within the universally  ...  In particular, Shai discovered a bug in a previous version of the proof of Theorem 1, and Akshay discovered a bug in a previous formulation of F cpke .  ... 
doi:10.1007/11681878_20 fatcat:cgkfnymnbzhdbbfjraz54euid4

Diffie-Hellman without Difficulty [chapter]

Sebastian Mödersheim
2012 Lecture Notes in Computer Science  
We provide a new relative-soundness result: for a large class of protocols, significantly restricting the abilities of the intruder is without loss of attacks.  ...  We also show the soundness of a very restrictive encoding of Diffie-Hellman proposed by Millen and how to obtain a problem that can be answered in the free algebra without increasing its size upon encoding  ...  Like the cited works for relative soundness, our result also relies on making restrictions on the class of protocols that are supported, in our case that Diffie-Hellman half-keys can be distinguished from  ... 
doi:10.1007/978-3-642-29420-4_14 fatcat:czjvwn2ak5asbeoa3vqcq4yv6a

A Sound Abstraction of the Parsing Problem

Sebastian Modersheim, Georgios Katsoris
2014 2014 IEEE 27th Computer Security Foundations Symposium  
We prove that the abstraction is sound for unambiguous, disjoint formats: there is an attack in the concrete message model if there is one in the abstract message model.  ...  Second, the formats should be pairwise disjoint: a string can be parsed as at most one of the formats. We show how to easily establish these properties for many practical formats.  ...  ACKNOWLEDGMENT This work was partially supported by the EU FP7 Project no. 318424, "FutureID: Shaping the Future of Electronic Identity" (futureid.eu).  ... 
doi:10.1109/csf.2014.26 dblp:conf/csfw/ModersheimK14 fatcat:4r2powhz4bchzlp2rmzj4pe3we

Bicategorical Semantics for Nondeterministic Computation

Mike Stay, Jamie Vicary
2013 Electronical Notes in Theoretical Computer Science  
We present a topological bicategorical syntax for the interaction between public and private information in classical information theory.  ...  This allows high-level graphical definitions of encrypted communication and secret sharing, including a characterization of their security properties, which are automatically satisfied with no extra axioms  ...  This mathematical model gives a reasonable abstraction for real-world public data services, such as the Domain Name Service, which stores public information redundantly on many independent computers.  ... 
doi:10.1016/j.entcs.2013.09.022 fatcat:habb3iqqozbs3gjuns7zp6is5m

Computational soundness of observational equivalence

Hubert Comon-Lundh, Véronique Cortier
2008 Proceedings of the 15th ACM conference on Computer and communications security - CCS '08  
We prove our result for symmetric encryption, but the same techniques can be applied to other security primitives such as signatures and public-key encryption.  ...  More precisely, we show a soundness theorem, following the line of research launched by Abadi and Rogaway in 2000: computational indistinguishability in presence of an active attacker is implied by the  ...  Acknowledgements We thank Michael Backes, Steve Kremer, Dominique Unruh and Bogdan Warinschi for their comments on this paper, as well as the anonymous referees.  ... 
doi:10.1145/1455770.1455786 dblp:conf/ccs/Comon-LundhC08 fatcat:dbx5ezjyc5hqzoyeauezphsdie

Automatic Verification of Security Properties in Remote Internet Voting Protocol with Applied Pi Calculus

Bo Meng, Wei Huang, Zimao Li, Dejun Wang
2010 International Journal of Digital Content Technology and its Applications  
It can handle many different cryptographic primitives, including shared-and public-key encryption and signatures, hash functions, and Deffie-Hellman key agreements, specified both as rewrite rules and  ...  Our choice is based on the fact that applied pi calculus allows the modeling of relations between data in a simple and precise manner using equational theories over term algebra.  ...  We thank Bruno Blanchet for his help on optimization of part inputs in ProVerif and comments. References  ... 
doi:10.4156/jdcta.vol4.issue7.9 fatcat:knrcy2p5abatxir6veqylwbnaq

Limits of the Cryptographic Realization of Dolev-Yao-Style XOR [chapter]

Michael Backes, Birgit Pfitzmann
2005 Lecture Notes in Computer Science  
On the positive side, we show the soundness of a rather general Dolev-Yao model with XOR and its realization under passive attacks.  ...  The abstraction of cryptographic operations by term algebras, called Dolev-Yao models, is essential in almost all tool-supported methods for proving security protocols.  ...  Here pke u denotes the public encryption key of user u and sks v the secret signing key of user v.  ... 
doi:10.1007/11555827_11 fatcat:bcbgl23sofevle5yvoq6btgzy4

Computationally sound verification of source code

Michael Backes, Matteo Maffei, Dominique Unruh
2010 Proceedings of the 17th ACM conference on Computer and communications security - CCS '10  
Combined with F7, this yields a computationally sound, automated verification of F# code containing public-key encryptions and signatures.  ...  lambda calculus RCF to model a core fragment of F#.  ...  This work was partially funded by the Cluster of Excellence "Multimodel Computing and Interaction" (German Science Foundation), the Emmy Noether Programme (German Science Foundation), the Miur'07 Project  ... 
doi:10.1145/1866307.1866351 dblp:conf/ccs/BackesMU10 fatcat:blfl4nf2wrdcpkzfbxy24vmk2q

A survey of algebraic properties used in cryptographic protocols

Véronique Cortier, Stéphanie Delaune, Pascal Lafourcade
2006 Journal of Computer Security  
Moreover, the executability of some protocols relies explicitly on some algebraic properties of cryptographic primitives such as commutative encryption.  ...  However, formal approaches usually consider the encryption schemes as black boxes and assume that an adversary cannot learn anything from an encrypted message except if he has the key.  ...  Acknowledgments The authors would like to thank anonymous referees for their very helpful comments and Ralf Treinen to have read a preliminary version of this survey.  ... 
doi:10.3233/jcs-2006-14101 fatcat:offe7jsai5e5rl7jswiccgsyiq

Computationally Sound Abstraction and Verification of Secure Multi-Party Computations

Michael Backes, Matteo Maffei, Esfandiar Mohammadi, Marc Herbstritt
2010 Foundations of Software Technology and Theoretical Computer Science  
We finally study the computational soundness of our abstraction, proving that the analysis of protocols expressed in the applied π-calculus and based on our abstraction provides computational security  ...  Based on this abstraction, we propose a methodology to mechanically analyze the security of cryptographic protocols employing secure multi-party computations.  ...  We show that our computational soundness result applies to a large class of protocols by proving the computational soundness of a symbolic model with public-key encryption, signatures, and arithmetics  ... 
doi:10.4230/lipics.fsttcs.2010.352 dblp:conf/fsttcs/BackesMM10 fatcat:5hkgzy3mebg2nbez6svuaj6j2i

An Algebra for Symbolic Diffie-Hellman Protocol Analysis [chapter]

Daniel J. Dougherty, Joshua D. Guttman
2013 Lecture Notes in Computer Science  
We study the algebra underlying symbolic protocol analysis for protocols using Diffie-Hellman operations.  ...  We realize this algebra as the set of normal forms of a particular rewriting theory.  ...  We assume that some of the asymmetric keys are of the form pk(A) and vk(A), where A ranges over names, denoting the public encryption and signature verification key of A.  ... 
doi:10.1007/978-3-642-41157-1_11 fatcat:ctpqvnz6w5cf7leyy2ow5ke6ay

Threshold Homomorphic Encryption in the Universally Composable Cryptographic Library [chapter]

Peeter Laud, Long Ngo
2008 Lecture Notes in Computer Science  
The library has been used to give the correctness proofs of various protocols; while the arguments in such proofs are similar to the ones done with the Dolev-Yao model that has been researched for a couple  ...  of decades already, the conclusions that such arguments provide are cryptographically sound.  ...  The first version of this library contained signature and public-key encryption schemes.  ... 
doi:10.1007/978-3-540-88733-1_21 fatcat:5wldnhukujhtbdmjpi7kfsg4hm
« Previous Showing results 1 — 15 out of 1,379 results