Sciweavers

719 search results - page 46 / 144
» Proving Security Protocols Correct
Sort
View
102
Voted
IACR
2011
107views more  IACR 2011»
13 years 9 months ago
Structure Preserving CCA Secure Encryption and Its Application to Oblivious Third Parties
In this paper we present the first public key encryption scheme that is structure preserving, i.e., our encryption scheme uses only algebraic operations. In particular it does not...
Jan Camenisch, Kristiyan Haralambiev, Markulf Kohl...
ASIACRYPT
2010
Springer
14 years 7 months ago
Optimistic Concurrent Zero Knowledge
We design cryptographic protocols that recognize best case (optimistic) situations and exploit them. As a case study, we present a new concurrent zeroknowledge protocol that is exp...
Alon Rosen, Abhi Shelat
99
Voted
IACR
2011
221views more  IACR 2011»
13 years 9 months ago
A Novel RFID Distance Bounding Protocol Based on Physically Unclonable Functions
Abstract. Radio Frequency Identification (RFID) systems are vulnerable to relay attacks (i.e., mafia, terrorist and distance frauds) when they are used for authentication purpose...
Süleyman Kardas, Mehmet Sabir Kiraz, Muhammed...
84
Voted
CSFW
2007
IEEE
15 years 4 months ago
Reasoning about Concurrency for Security Tunnels
There has been excellent progress on languages for rigorously describing key exchange protocols and techniques for proving that the network security tunnels they establish preserv...
Alwyn Goodloe, Carl A. Gunter
81
Voted
SAC
2006
ACM
15 years 3 months ago
Bootstrapping multi-party ad-hoc security
Increasingly pervasive computing throws up scenarios where users may wish to achieve some degree of security in their interaction with other people or equipment, in contexts where...
Sadie Creese, Michael Goldsmith, Bill Roscoe, Ming...