Sciweavers

2967 search results - page 232 / 594
» Cryptology
Sort
View
CRYPTO
2001
Springer
145views Cryptology» more  CRYPTO 2001»
15 years 11 months ago
Pseudorandomness from Braid Groups
Recently the braid groups were introduced as a new source for cryptography. The group operations are performed efficiently and the features are quite different from those of other...
Eonkyung Lee, Sangjin Lee, Sang Geun Hahn
CRYPTO
2001
Springer
144views Cryptology» more  CRYPTO 2001»
15 years 11 months ago
Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation
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...
Yehuda Lindell
CRYPTO
2001
Springer
97views Cryptology» more  CRYPTO 2001»
15 years 11 months ago
Two-Party Generation of DSA Signatures
d Abstract) Philip MacKenzie and Michael K. Reiter Bell Labs, Lucent Technologies, Murray Hill, NJ, USA We describe a means of sharing the DSA signature function, so that two parti...
Philip D. MacKenzie, Michael K. Reiter
CRYPTO
2001
Springer
162views Cryptology» more  CRYPTO 2001»
15 years 11 months ago
New Public Key Cryptosystem Using Finite Non Abelian Groups
Most public key cryptosystems have been constructed based on abelian groups up to now. We propose a new public key cryptosystem built on finite non abelian groups in this paper. I...
Seong-Hun Paeng, Kil-Chan Ha, Jae Heon Kim, Seongt...
CTRSA
2001
Springer
109views Cryptology» more  CTRSA 2001»
15 years 11 months ago
Uncheatable Distributed Computations
Computationally expensive tasks that can be parallelized are most efficiently completed by distributing the computation among a large number of processors. The growth of the Intern...
Philippe Golle, Ilya Mironov