103 search results - page 7 / 21 » Unconditionally secure cryptosystems based on quantum crypto... |
CRYPTO
2012
Springer
11 years 10 months ago
2012
Springer
We give the first proof of security for an identity-based encryption scheme in the quantum random oracle model. This is the first proof of security for any scheme in this model ...
CRYPTO
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We propose a way to establish peer-to-peer authenticated communications over an insecure channel by using an extra channel which can authenticate very short strings, e.g....
19
Voted
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Given two elliptic curves over a finite field having the same cardinality and endomorphism ring, it is known that the curves admit an isogeny between them, but finding such an isog...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
Chebyshev polynomials have been recently proposed for designing public-key systems. Indeed, they enjoy some nice chaotic properties, which seem to be suitable for use in Cryptogra...
SOFSEM
2005
Springer
14 years 28 days 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...