8 search results - page 1 / 2 » On the (non)Universality of the One-Time Pad |
FOCS
2002
IEEE
13 years 9 months ago
2002
IEEE
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...
SOFSEM
2005
Springer
13 years 10 months ago
2005
Springer
Motivated by a potentially flawed deployment of the one time pad in a recent quantum cryptographic application securing a bank transfer [12], we show how to implement a statistica...
IJNSEC
2008
13 years 4 months ago
2008
In 1949, Shannon proved the perfect secrecy of the Vernam cryptographic system (One-Time Pad or OTP). It has generally been believed that the perfectly random and uncompressible O...
ACSAC
2002
IEEE
13 years 9 months ago
2002
IEEE
The blooming e-commerce is demanding better methods to protect online users' privacy, especially the credit card information that is widely used in online shopping. Holding a...
ACSAC
2000
IEEE
13 years 9 months ago
2000
IEEE
We present a new commerce protocol that allows customers and merchants to conduct face-to-face creditcard authorizations with a credit card company securely with the option of ano...