Sciweavers

3504 search results - page 485 / 701
» Secure protocol composition
Sort
View
79
Voted
ICCCN
2008
IEEE
15 years 8 months ago
A New Proposal for QKD Relaying Models
—We investigate a quasi-trusted QKD relaying model. This is a three-party communication model. Two nodes Alice and Bob want to establish a secret key. However, the distance betwe...
Cuong Le Quoc, Patrick Bellot
ACSC
2005
IEEE
15 years 7 months ago
SuperstringRep: Reputation-enhanced Service Discovery
1 Service discovery protocols are used in distributed systems to locate services for clients. The services that are located as well as the clients requesting service are commonly a...
Ryan Wishart, Ricky Robinson, Jadwiga Indulska
103
Voted
FOCS
2005
IEEE
15 years 7 months ago
Cryptography In the Bounded Quantum-Storage Model
We initiate the study of two-party cryptographic primitives with unconditional security, assuming that the adversary’s quantum memory is of bounded size. We show that oblivious ...
Ivan Damgård, Serge Fehr, Louis Salvail, Chr...
PKC
2004
Springer
160views Cryptology» more  PKC 2004»
15 years 7 months ago
Constant Round Authenticated Group Key Agreement via Distributed Computation
Abstract. A group key agreement protocol allows a set of users, communicating over a public network, to agree on a private session key. Most of the schemes proposed so far require ...
Emmanuel Bresson, Dario Catalano
110
Voted
CRYPTO
2006
Springer
134views Cryptology» more  CRYPTO 2006»
15 years 5 months ago
Round-Optimal Composable Blind Signatures in the Common Reference String Model
We build concurrently executable blind signatures schemes in the common reference string model, based on general complexity assumptions, and with optimal round complexity. Namely, ...
Marc Fischlin