Sciweavers

3504 search results - page 518 / 701
» Secure protocol composition
Sort
View
ICQNM
2008
IEEE
201views Chemistry» more  ICQNM 2008»
15 years 8 months ago
Loss-Tolerant Quantum Coin Flipping
Coin flipping is a cryptographic primitive in which two spatially separated players, who in principle do not trust each other, wish to establish a common random bit. If we limit ...
Guido Berlín, Gilles Brassard, Félix...
CRYPTO
2007
Springer
145views Cryptology» more  CRYPTO 2007»
15 years 7 months ago
Chernoff-Type Direct Product Theorems
Consider a challenge-response protocol where the probability of a correct response is at least α for a legitimate user and at most β < α for an attacker. One example is a CAP...
Russell Impagliazzo, Ragesh Jaiswal, Valentine Kab...
TCC
2007
Springer
93views Cryptology» more  TCC 2007»
15 years 7 months ago
Intrusion-Resilient Key Exchange in the Bounded Retrieval Model
Abstract. We construct an intrusion-resilient symmetric-key authenticated key exchange (AKE) protocol in the bounded retrieval model. The model employs a long shared private key to...
David Cash, Yan Zong Ding, Yevgeniy Dodis, Wenke L...
ISCC
2005
IEEE
15 years 7 months ago
Towards Flexible Authorization Management
During the last years there have been a lot of proposals in the literature for systems that attempt to manage the process of trust establishment. However, the engineering details ...
Patroklos G. Argyroudis, Donal O'Mahony
116
Voted
ACNS
2005
Springer
97views Cryptology» more  ACNS 2005»
15 years 7 months ago
Thompson's Group and Public Key Cryptography
Recently, several public key exchange protocols based on symbolic computation in non-commutative (semi)groups were proposed as a more efficient alternative to well established prot...
Vladimir Shpilrain, Alexander Ushakov