Sciweavers

38 search results - page 3 / 8
» Soundness Conditions for Message Encoding Abstractions in Fo...
Sort
View
TGC
2007
Springer
14 years 2 months ago
Computational Soundness of Equational Theories (Tutorial)
Abstract. We study the link between formal and cryptographic models for security protocols in the presence of passive and adaptive adversaries. We first describe the seminal resul...
Steve Kremer
CSFW
2006
IEEE
14 years 2 months ago
Cryptographically Sound Theorem Proving
We describe a faithful embedding of the Dolev-Yao model of Backes, Pfitzmann, and Waidner (CCS 2003) in the theorem prover Isabelle/HOL. This model is cryptographically sound in ...
Christoph Sprenger, Michael Backes, David A. Basin...
CORR
2004
Springer
120views Education» more  CORR 2004»
13 years 8 months ago
Validating a Web Service Security Abstraction by Typing
Abstraction by Typing Andrew D. Gordon Microsoft Research Riccardo Pucella Cornell University An XML web service is, to a first approximation, an RPC service in which requests and...
Andrew D. Gordon, Riccardo Pucella
ICALP
2010
Springer
13 years 10 months ago
From Secrecy to Soundness: Efficient Verification via Secure Computation
d Abstract) Benny Applebaum1 , Yuval Ishai2 , and Eyal Kushilevitz3 1 Computer Science Department, Weizmann Institute of Science 2 Computer Science Department, Technion and UCLA 3 ...
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
SP
2008
IEEE
132views Security Privacy» more  SP 2008»
13 years 7 months ago
Zero-Knowledge in the Applied Pi-calculus and Automated Verification of the Direct Anonymous Attestation Protocol
e an abstraction of zero-knowledge protocols that is le to a fully mechanized analysis. The abstraction is formalized within the applied pi-calculus using a novel equational theor...
Michael Backes, Matteo Maffei, Dominique Unruh