Sciweavers

180 search results - page 10 / 36
» Discrete Logarithm Based Protocols
Sort
View
SODA
2012
ACM
177views Algorithms» more  SODA 2012»
13 years 1 days ago
Stochastic coalescence in logarithmic time
The following distributed coalescence protocol was introduced by Dahlia Malkhi in 2006 motivated by applications in social networking. Initially there are n agents wishing to coal...
Po-Shen Loh, Eyal Lubetzky
ISW
2010
Springer
14 years 7 months ago
Efficient Computationally Private Information Retrieval from Anonymity or Trapdoor Groups
A Private Information Retrieval (PIR) protocol allows a database user, or client, to obtain information from a data- base in a manner that prevents the database from knowing which...
Jonathan T. Trostle, Andy Parrish
EUROCRYPT
2006
Springer
15 years 1 months ago
The Function Field Sieve in the Medium Prime Case
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...
Antoine Joux, Reynald Lercier
IJNSEC
2007
131views more  IJNSEC 2007»
14 years 9 months ago
On the Security of Huang-Chang Multi-signature Schemes
Recently, based on RSA and discrete logarithm with composite modulus, Huang and Chang proposed two multisignature schemes with distinguished signing authority and claimed that the...
Jianhong Zhang, Wei Zou
ISPEC
2009
Springer
15 years 4 months ago
Strongly Unforgeable ID-Based Signatures without Random Oracles
In this paper, we construct a strongly unforgeable ID-based signature scheme without random oracles.4 The signature size of our scheme is smaller than that of other schemes based o...
Chifumi Sato, Takeshi Okamoto, Eiji Okamoto