252 search results - page 11 / 51 » How Secure is Deterministic Encryption |
INDOCRYPT
2005
Springer
14 years 1 months ago
2005
Springer
We propose a scheme for electronic cash based on symmetric primitives. The scheme is secure in the framework for universal composability assuming the existence of a symmetric CCA2-...
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 ...
CTRSA
2012
Springer
12 years 3 months ago
2012
Springer
We study the problem of searching on encrypted data, where the search is performed using a plaintext message or a keyword, rather than a message-specific trapdoor as done by state...
APPROX
2004
Springer
14 years 1 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...
CSFW
2004
IEEE
13 years 11 months ago
2004
IEEE
Recently we showed how to justify a Dolev-Yao type model of cryptography as used in virtually all automated protocol provers under active attacks and in arbitrary protocol environ...