677 search results - page 15 / 136 » Secure Pseudonymous Channels |
EUROCRYPT
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. We present a formalism for the analysis of key-exchange protocols that combines previous definitional approaches and results in a definition of security that enjoys som...
WPES
2003
ACM
15 years 2 months ago
2003
ACM
Ì × Ô Ô Ö ÔÖ × ÒØ× Ò Û Ñ Ø Ó × Ò Ð Ò ÒÓÒÝÑÓÙ× Óѹ ÑÙÒ Ø ÓÒ ÓÒ Ø ÁÒØ ÖÒ Øº Ï × Ö Ò Û ÔÖÓØÓ ÓÐ Ø Ø ÐÐÓÛ× Ù× ØÓ ...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
In secure multi-party computation n parties jointly evaluate an n-variate function f in the presence of an adversary which can corrupt up till t parties. All honest parties are req...
ASIACRYPT
1999
Springer
15 years 1 months ago
1999
Springer
Problems of secure communication and computation have been studied extensively in network models. Goldreich, Goldwasser, and Linial, Franklin and Yung, and Franklin and Wright have...
ISITA
2010
14 years 4 months ago
2010
Recently, the exact solution of the capacity of an attenuated quantum channel which is a model of a long distance optical fiber channel was derived [V. Giovannetti, et al., Phys. R...