92 search results - page 17 / 19 » New Efficient and Secure Protocols for Verifiable Signature ... |
EUROCRYPT
2006
Springer
13 years 9 months ago
2006
Springer
In this paper, we study the application of the function field sieve algorithm for computing discrete logarithms over finite fields of the form Fqn when q is a medium-sized prime po...
OOPSLA
1999
Springer
13 years 10 months ago
1999
Springer
Object-based parallel and distributed applications are becoming increasingly popular, driven by the programmability advantages of component technology and a flat shared-object spa...
EUROCRYPT
2006
Springer
13 years 9 months ago
2006
Springer
In this work we provide efficient distributed protocols for generating shares of random noise, secure against malicious participants. The purpose of the noise generation is to crea...
BIRTHDAY
2003
Springer
13 years 11 months ago
2003
Springer
Abstract. Bounded fairness is a stronger notion than ordinary eventuality-based fairness, one that guarantees occurrence of an event within a fixed number of occurrences of anothe...
STOC
2009
ACM
14 years 6 months ago
2009
ACM
We study the question of basing symmetric key cryptography on weak secrets. In this setting, Alice and Bob share an n-bit secret W, which might not be uniformly random, but the ad...