56 search results - page 8 / 12 » An Efficient Group Signature Based on the Discrete Logarithm... |
87
Voted
ANTS
2006
Springer
15 years 3 months ago
2006
Springer
This paper suggests a new building block for cryptographic protocols and gives two instantiations of it. The concept is to generate two descriptions of the same group: a public des...
115
click to vote
ISW
2010
Springer
14 years 9 months ago
2010
Springer
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...
93
Voted
ACSC
2008
IEEE
15 years 6 months ago
2008
IEEE
We propose a more efficient privacy preserving set intersection protocol which improves the previously known result by a factor of O(N) in both the computation and communication c...
100
Voted
ACNS
2005
Springer
15 years 5 months ago
2005
Springer
Recently, several public key exchange protocols based on symbolic computation in non-commutative (semi)groups were proposed as a more efficient alternative to well established prot...
CRYPTO
2008
Springer
15 years 1 months ago
2008
Springer
Despite considerable research efforts, no efficient reduction from the discrete log problem to forging a discrete log based signature (e.g. Schnorr) is currently known. In fact, ne...