Sciweavers

297 search results - page 12 / 60
» Formal Analysis of a Non-Repudiation Protocol
Sort
View
CSFW
2009
IEEE
14 years 2 months ago
Decidable Analysis for a Class of Cryptographic Group Protocols with Unbounded Lists
Cryptographic protocols are crucial for securing electronic transactions. The confidence in these protocols can be increased by the formal analysis of their security properties. ...
Najah Chridi, Mathieu Turuani, Michaël Rusino...
FUIN
2008
107views more  FUIN 2008»
13 years 7 months ago
Modelling and Simulation of Quantum Teleportation and Dense Coding Using Predicate/Transition-Nets
Reachability analysis is one of the most successful methods used in design and validation of protocols for classical communication, whereas the predicate/transition-net formalism i...
Kimmo Varpaaniemi, Leo Ojala
SP
2008
IEEE
132views Security Privacy» more  SP 2008»
13 years 6 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
ESOP
2004
Springer
14 years 28 days ago
Compositional Analysis of Authentication Protocols
ESOP 2004, LNCS 2986, pages 140–154, 2004. c Springer–Verlag, Berlin Heildelberg 2003. We propose a new method for the static analysis of entity authentication protocols. We d...
Michele Bugliesi, Riccardo Focardi, Matteo Maffei
CCS
2008
ACM
13 years 9 months ago
Secure neighbor discovery in wireless networks: formal investigation of possibility
Wireless communication enables a broad spectrum of applications, ranging from commodity to tactical systems. Neighbor discovery (ND), that is, determining which devices are within...
Marcin Poturalski, Panos Papadimitratos, Jean-Pier...