Sciweavers

273 search results - page 42 / 55
» Modular Security Proofs for Key Agreement Protocols
Sort
View
LICS
1999
IEEE
13 years 11 months ago
Proof Techniques for Cryptographic Processes
Contextual equivalences for cryptographic process calculi, like the spi-calculus, can be used to reason about correctness of protocols, but their definition suffers from quantific...
Michele Boreale, Rocco De Nicola, Rosario Pugliese
WCC
2005
Springer
123views Cryptology» more  WCC 2005»
14 years 29 days ago
RSA-Based Secret Handshakes
A secret handshake mechanism allows two entities, members of a same group, to authenticate each other secretly. This primitive was introduced recently by Balfanz, Durfee, Shankar, ...
Damien Vergnaud
CSFW
2007
IEEE
14 years 1 months ago
The Insecurity Problem: Tackling Unbounded Data
In this paper we focus on tackling the insecurity problem of security protocols in the presence of an unbounded number of data such as nonces or session keys. First, we pinpoint f...
Sibylle B. Fröschle
PET
2012
Springer
11 years 10 months ago
Fault-Tolerant Privacy-Preserving Statistics
Real-time statistics on smart meter consumption data must preserve consumer privacy and tolerate smart meter failures. Existing protocols for this private distributed aggregation m...
Marek Jawurek, Florian Kerschbaum
ACNS
2010
Springer
159views Cryptology» more  ACNS 2010»
14 years 9 days ago
A Message Recognition Protocol Based on Standard Assumptions
We look at the problem of designing Message Recognition Protocols (MRP) and note that all proposals available in the literature have relied on security proofs which hold in the ran...
Atefeh Mashatan, Serge Vaudenay