Sciweavers

37 search results - page 3 / 8
» Protocol Security and Algebraic Properties: Decision Results...
Sort
View
IANDC
2008
105views more  IANDC 2008»
13 years 5 months ago
Symbolic protocol analysis for monoidal equational theories
We are interested in the design of automated procedures for analyzing the (in)security of cryptographic protocols in the Dolev-Yao model for a bounded number of sessions when we t...
Stéphanie Delaune, Pascal Lafourcade, Denis...
CADE
2008
Springer
14 years 5 months ago
Proving Group Protocols Secure Against Eavesdroppers
Security protocols are small programs designed to ensure properties such as secrecy of messages or authentication of parties in a hostile environment. In this paper we investigate ...
Steve Kremer, Antoine Mercier 0002, Ralf Treinen
ECCC
2007
144views more  ECCC 2007»
13 years 5 months ago
Algebraic Lower Bounds for Computing on Encrypted Data
In cryptography, there has been tremendous success in building primitives out of homomorphic semantically-secure encryption schemes, using homomorphic properties in a blackbox way...
Rafail Ostrovsky, William E. Skeith III
FUIN
2007
99views more  FUIN 2007»
13 years 5 months ago
Verifying Security Protocols Modelled by Networks of Automata
In this paper we show a novel method for modelling behaviours of security protocols using networks of communicating automata in order to verify them with SAT-based bounded model ch...
Miroslaw Kurkowski, Wojciech Penczek
CSFW
2005
IEEE
13 years 11 months ago
Reconstruction of Attacks against Cryptographic Protocols
We study an automatic technique for the verification of cryptographic protocols based on a Horn clause model of the protocol. This technique yields proofs valid for an unbounded ...
Xavier Allamigeon, Bruno Blanchet