Sciweavers

100 search results - page 10 / 20
» Alice and Bob
Sort
View
CORR
2008
Springer
122views Education» more  CORR 2008»
13 years 7 months ago
Breaking One-Round Key-Agreement Protocols in the Random Oracle Model
In this work we deal with one-round key-agreement protocols, called Merkle's Puzzles, in the random oracle model, where the players Alice and Bob are allowed to query a rando...
Miroslava Sotáková
ICQNM
2008
IEEE
178views Chemistry» more  ICQNM 2008»
14 years 2 months ago
A Quantum Network Manager that Supports a One-Time Pad Stream
We have begun to expand the NIST quantum key distribution (QKD) system into a quantum network to support secure cryptography. We are starting with a simple three-node network, one...
Alan Mink, Lijun Ma, Tassos Nakassis, Hai Xu, Oliv...
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
14 years 8 months ago
Non-malleable extractors and symmetric key cryptography from weak secrets
We study the question of basing symmetric key cryptography on weak secrets. In this setting, Alice and Bob share an n-bit secret W, which might not be uniformly random, but the ad...
Yevgeniy Dodis, Daniel Wichs
AC
1998
Springer
13 years 12 months ago
The Search for the Holy Grail in Quantum Cryptography
Abstract. In 1982, Bennett and Brassard suggested a new way to provide privacy in long distance communications with security based on the correctness of the basic principles of qua...
Louis Salvail
TIT
2011
125views more  TIT 2011»
13 years 2 months ago
Unidirectional Chosen-Ciphertext Secure Proxy Re-Encryption
Abstract. In 1998, Blaze, Bleumer, and Strauss proposed a cryptographic primitive called proxy re-encryption, in which a proxy transforms – without seeing the corresponding plain...
Benoît Libert, Damien Vergnaud