103 search results - page 17 / 21 » Unconditionally secure cryptosystems based on quantum crypto... |
CRYPTO
2010
Springer
13 years 8 months ago
2010
Springer
The search for encryption schemes that allow to evaluate functions (or circuits) over encrypted data has attracted a lot of attention since the seminal work on this subject by Rive...
ACNS
2007
Springer
14 years 1 months ago
2007
Springer
Many protocols that are based on homomorphic encryption are private only if a client submits inputs from a limited range S. Conditional disclosure of secrets (CDS) helps to overcom...
CHES
2007
Springer
14 years 1 months ago
2007
Springer
The hardness of the integer factorization problem assures the security of some public-key cryptosystems including RSA, and the number field sieve method (NFS), the most efficient ...
IJNSEC
2006
13 years 7 months ago
2006
It has always been a critical issue to find efficient methods for fast revocation of a user's identity in identity (ID)based cryptosystems. Unfortunately, none of the previou...
TCC
2007
Springer
14 years 1 months ago
2007
Springer
Assume that two distant parties, Alice and Bob, as well as an adversary, Eve, have access to (quantum) systems prepared jointly according to a tripartite state ρABE. In addition, ...