Sciweavers

3115 search results - page 189 / 623
» Synthesizing Secure Protocols
Sort
View
130
Voted
CCS
2008
ACM
15 years 5 months ago
Location privacy of distance bounding protocols
Distance bounding protocols have been proposed for many security critical applications as a means of getting an upper bound on the physical distance to a communication partner. As...
Kasper Bonne Rasmussen, Srdjan Capkun
CN
2006
117views more  CN 2006»
15 years 3 months ago
Using equivalence-checking to verify robustness to denial of service
In this paper, we introduce a new security property which intends to capture the ability of a cryptographic protocol being resistant to denial of service. This property, called im...
Stéphane Lafrance
148
Voted
ASIACRYPT
2010
Springer
15 years 1 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
ICECCS
2005
IEEE
136views Hardware» more  ICECCS 2005»
15 years 9 months ago
Model-Based Design and Analysis of Permission-Based Security
To guarantee the security of computer systems, it is necessary to define security permissions to restrict the access to the systems’ resources. These permissions rely on certai...
Jan Jürjens, Markus Lehrhuber, Guido Wimmel
TCC
2009
Springer
130views Cryptology» more  TCC 2009»
16 years 4 months ago
Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer
In the setting of secure computation, a set of parties wish to securely compute some function of their inputs, in the presence of an adversary. The adversary in question may be st...
Yehuda Lindell, Hila Zarosim