1562 search results - page 66 / 313 » Mathematics, Cryptology, Security |
CTRSA
2006
Springer
13 years 11 months ago
2006
Springer
This paper studies a new problem called fair identification: given two parties, how should they identify each other in a fair manner. More precisely, if both parties are honest the...
EUROCRYPT
2006
Springer
13 years 11 months ago
2006
Springer
We propose simple, realistic protocols for polling that allow the responder to plausibly repudiate his response, while at the same time allow accurate statistical analysis of poll ...
EUROCRYPT
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. We study the problem of partial key exposure. Standard cryptographic definitions and constructions do not guarantee any security even if a tiny fraction of the secret key...
CRYPTO
1991
Springer
13 years 11 months ago
1991
Springer
In this paper, we study the application of universal hashingto the construction of unconditionally secure authentication codes without secrecy. This idea is most useful when the nu...
ASIACRYPT
2008
Springer
13 years 10 months ago
2008
Springer
Encryption schemes that support computation on encrypted data are useful in constructing efficient and intuitively simple cryptographic protocols. However, the approach was previo...