77 search results - page 8 / 16 » On the Security of Pseudorandomized Information-Theoreticall... |
ASIACRYPT
1991
Springer
14 years 3 days ago
1991
Springer
In [1] a construction of a block cipher from a single pseudorandom permutation is proposed. In a complexity theoretical setting they prove that this scheme is secure against a pol...
APPROX
2004
Springer
14 years 2 months ago
2004
Springer
A quantum encryption scheme (also called private quantum channel, or state randomization protocol) is a one-time pad for quantum messages. If two parties share a classical random s...
EUROCRYPT
1999
Springer
14 years 26 days ago
1999
Springer
Abstract. This work describes schemes for distributing between n servers the evaluation of a function f which is an approximation to a random function, such that only authorized su...
TCC
2010
Springer
14 years 5 months ago
2010
Springer
We construct public-key cryptosystems that remain secure even when the adversary is given any computationally uninvertible function of the secret key as auxiliary input (even one t...
CANS
2007
Springer
14 years 2 months ago
2007
Springer
We consider a key distribution scheme for securing node-to-node communication in sensor networks. While most schemes in use are based on random predistribution, we consider a syste...