Sciweavers

719 search results - page 39 / 144
» Proving Security Protocols Correct
Sort
View
SP
2008
IEEE
132views Security Privacy» more  SP 2008»
14 years 8 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
FSTTCS
2010
Springer
14 years 7 months ago
Computationally Sound Abstraction and Verification of Secure Multi-Party Computations
ionally Sound Abstraction and Verification of Secure Multi-Party Computations Michael Backes Saarland University MPI-SWS Matteo Maffei Saarland University Esfandiar Mohammadi Saarl...
Michael Backes, Matteo Maffei, Esfandiar Mohammadi
IEEEARES
2009
IEEE
15 years 4 months ago
Routing Protocol Security Using Symmetric Key Based Techniques
—In this paper, we address the security of routing protocols. Internet routing protocols are subject to attacks in the control plane as well as the data plane. In the control pla...
Bezawada Bruhadeshwar, Kishore Kothapalli, M. Poor...
CMS
2003
171views Communications» more  CMS 2003»
14 years 11 months ago
Securing the Border Gateway Protocol: A Status Update
The Border Gateway Protocol (BGP) is a critical component of the Internet routing infrastructure, used to distribute routing information between autonomous systems (ASes). It is hi...
Stephen T. Kent
TCC
2005
Springer
163views Cryptology» more  TCC 2005»
15 years 3 months ago
Adaptive Security of Symbolic Encryption
Abstract. We prove a computational soundness theorem for the symbolic analysis of cryptographic protocols which extends an analogous theorem of Abadi and Rogaway (J. of Cryptology ...
Daniele Micciancio, Saurabh Panjwani