Sciweavers

1825 search results - page 46 / 365
» Cryptographic Securities Exchanges
Sort
View
ICALP
2005
Springer
15 years 11 months ago
Computationally Sound Implementations of Equational Theories Against Passive Adversaries
In this paper we study the link between formal and cryptographic models for security protocols in the presence of a passive adversary. In contrast to other works, we do not conside...
Mathieu Baudet, Véronique Cortier, Steve Kr...
CCS
2009
ACM
16 years 6 months ago
An ID-based authenticated key exchange protocol based on bilinear Diffie-Hellman problem
In this paper, we present a new ID-based two-party authenticated key exchange (AKE) protocol, which makes use of a new technique called twin Diffie-Hellman problem proposed by Cas...
Hai Huang, Zhenfu Cao
ESORICS
2005
Springer
15 years 11 months ago
Limits of the Cryptographic Realization of Dolev-Yao-Style XOR
The abstraction of cryptographic operations by term algebras, called Dolev-Yao models, is essential in almost all tool-supported methods for proving security protocols. Recently si...
Michael Backes, Birgit Pfitzmann
ESORICS
2003
Springer
15 years 11 months ago
Initiator-Resilient Universally Composable Key Exchange
Abstract. Key exchange protocols in the setting of universal composability are investigated. First we show that the ideal functionality FKE of [9] cannot be realized in the presenc...
Dennis Hofheinz, Jörn Müller-Quade, Rain...
TIT
2008
164views more  TIT 2008»
15 years 5 months ago
Cryptographic Hardness Based on the Decoding of Reed-Solomon Codes
We investigate the decoding problem of Reed-Solomon (RS) Codes, also known as the Polynomial Reconstruction Problem (PR), from a cryptographic hardness perspective. Namely, we dea...
Aggelos Kiayias, Moti Yung