1562 search results - page 50 / 313 » Mathematics, Cryptology, Security |
ASIACRYPT
2005
Springer
15 years 3 months ago
2005
Springer
The security of key agreement protocols has traditionally been notoriously hard to establish. In this paper we present a modular approach to the construction of proofs of security ...
CRYPTO
2001
Springer
15 years 2 months ago
2001
Springer
In this paper we show that any two-party functionality can be securely computed in a constant number of rounds, where security is obtained against malicious adversaries that may ar...
CRYPTO
2000
Springer
15 years 2 months ago
2000
Springer
Abstract. The Full Domain Hash (FDH) scheme is a RSA-based signature scheme in which the message is hashed onto the full domain of the RSA function. The FDH scheme is provably secu...
FC
2010
Springer
15 years 1 months ago
2010
Springer
Abstract We propose several variants of a secure multiparty computation protocol for AES encryption. The best variant requires 2200 + 400 255 expected elementary operations in expe...
EUROCRYPT
2006
Springer
15 years 1 months ago
2006
Springer
To prove that a secure key-agreement protocol exists one must at least show P = NP. Moreover any proof that the sequential composition of two non-adaptively secure pseudorandom fun...