Sciweavers

1562 search results - page 40 / 313
» Mathematics, Cryptology, Security
Sort
View
CANS
2009
Springer
132views Cryptology» more  CANS 2009»
14 years 1 days ago
Fully Robust Tree-Diffie-Hellman Group Key Exchange
We extend the well-known Tree-Diffie-Hellman technique used for the design of group key exchange (GKE) protocols with robustness, i.e. with resistance to faults resulting from poss...
Timo Brecher, Emmanuel Bresson, Mark Manulis
EUROCRYPT
2009
Springer
14 years 8 months ago
Practical Chosen Ciphertext Secure Encryption from Factoring
We propose a practical public-key encryption scheme whose security against chosen-ciphertext attacks can be reduced in the standard model to the assumption that factoring is intrac...
Dennis Hofheinz, Eike Kiltz
CRYPTO
2000
Springer
133views Cryptology» more  CRYPTO 2000»
14 years 11 days ago
Provably Secure Partially Blind Signatures
Partially blind signature schemes are an extension of blind signature schemes that allow a signer to explicitly include necessary information (expiration date, collateral condition...
Masayuki Abe, Tatsuaki Okamoto
EUROCRYPT
1998
Springer
14 years 8 days ago
Securing Threshold Cryptosystems against Chosen Ciphertext Attack
For the most compelling applications of threshold cryptosystems, security against chosen ciphertext attack is a requirement. However, prior to the results presented here, there ap...
Victor Shoup, Rosario Gennaro
CRYPTO
2006
Springer
99views Cryptology» more  CRYPTO 2006»
13 years 11 months ago
Scalable Secure Multiparty Computation
We present the first general protocol for secure multiparty computation which is scalable, in the sense that the amortized work per player does not grow, and in some natural settin...
Ivan Damgård, Yuval Ishai