Sciweavers

1612 search results - page 16 / 323
» About models of security protocols
Sort
View
114
Voted
ENTCS
2007
129views more  ENTCS 2007»
15 years 3 months ago
Protocol Composition Logic (PCL)
Protocol Composition Logic (PCL) is a logic for proving security properties of network protocols that use public and symmetric key cryptography. The logic is designed around a pro...
Anupam Datta, Ante Derek, John C. Mitchell, Arnab ...
133
Voted
CANS
2009
Springer
132views Cryptology» more  CANS 2009»
15 years 7 months ago
Fully Robust Tree-Diffie-Hellman Group Key Exchange
We extend the well-known Tree-Diffie-Hellman technique used for the design of group key exchange (GKE) protocols with robustness, i.e. with resistance to faults resulting from poss...
Timo Brecher, Emmanuel Bresson, Mark Manulis
132
Voted
EUROCRYPT
2007
Springer
15 years 9 months ago
Simulatable Adaptive Oblivious Transfer
We study an adaptive variant of oblivious transfer in which a sender has N messages, of which a receiver can adaptively choose to receive k one-after-the-other, in such a way that ...
Jan Camenisch, Gregory Neven, Abhi Shelat
CTRSA
2006
Springer
90views Cryptology» more  CTRSA 2006»
15 years 7 months ago
Fair Identification
This paper studies a new problem called fair identification: given two parties, how should they identify each other in a fair manner. More precisely, if both parties are honest the...
Omkant Pandey, Julien Cathalo, Jean-Jacques Quisqu...
119
Voted
CONCUR
2008
Springer
15 years 5 months ago
Modeling Computational Security in Long-Lived Systems
Abstract. For many cryptographic protocols, security relies on the assumption that adversarial entities have limited computational power. This type of security degrades progressive...
Ran Canetti, Ling Cheung, Dilsun Kirli Kaynar, Nan...