Sciweavers

8 search results - page 2 / 2
» Re-visiting the One-Time Pad
Sort
View
FOCS
2002
IEEE
13 years 10 months ago
On the (non)Universality of the One-Time Pad
Randomization is vital in cryptography: secret keys should be randomly generated and most cryptographic primitives (e.g., encryption) must be probabilistic. As a bstraction, it is...
Yevgeniy Dodis, Joel Spencer
CSFW
2005
IEEE
13 years 11 months ago
Computational and Information-Theoretic Soundness and Completeness of Formal Encryption
We consider expansions of the Abadi-Rogaway logic of indistinguishability of formal cryptographic expressions. We expand the logic in order to cover cases when partial information...
Pedro Adão, Gergei Bana, Andre Scedrov
CRYPTO
2005
Springer
107views Cryptology» more  CRYPTO 2005»
13 years 10 months ago
A Quantum Cipher with Near Optimal Key-Recycling
Abstract. Assuming an insecure quantum channel and an authenticated classical channel, we propose an unconditionally secure scheme for encrypting classical messages under a shared ...
Ivan Damgård, Thomas Brochmann Pedersen 0002...