39 search results - page 7 / 8 » Cryptography In the Bounded Quantum-Storage Model |
TCC
2010
Springer
14 years 4 months ago
2010
Springer
We describe the first domain extender for ideal ciphers, i.e. we show a construction that is indifferentiable from a 2n-bit ideal cipher, given a n-bit ideal cipher. Our construc...
EUROCRYPT
2007
Springer
14 years 1 months ago
2007
Springer
We study conditional computational entropy: the amount of randomness a distribution appears to have to a computationally bounded observer who is given some correlated information....
ACNS
2005
Springer
14 years 1 months ago
2005
Springer
k-times anonymous authentication (k-TAA) schemes allow members of a group to be anonymously authenticated by application providers for a bounded number of times. k-TAA has applicat...
EUROCRYPT
2004
Springer
14 years 1 months ago
2004
Springer
It is well-known that n players connected only by pairwise secure channels can achieve multi-party computation secure against an active adversary if and only if – t < n/2 of t...
PAIRING
2007
Springer
14 years 1 months ago
2007
Springer
This paper puts forward new efficient constructions for public-key broadcast encryption that simultaneously enjoy the following properties: receivers are stateless; encryption is c...