127 search results - page 8 / 26 » On Cryptographic Schemes Based on Discrete Logarithms and Fa... |
ICICS
2001
Springer
14 years 11 days ago
2001
Springer
Undeniable signature has been extensively researched after Chaum and Antwerpen first proposed the concept of this special digital signature ten years ago. Up to now, however, almo...
PKC
2001
Springer
14 years 11 days ago
2001
Springer
At ISW’99, Nishioka, Hanaoka and Imai proposed a digital signature scheme on ID-based key-sharing infrastructures. That signature scheme is claimed to be secure if the discrete l...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Once quantum computers reach maturity most of today's traditional cryptographic schemes based on RSA or discrete logarithms become vulnerable to quantum-based attacks. Hence, ...
EUROCRYPT
1999
Springer
14 years 6 days ago
1999
Springer
In this paper we discuss various aspects of cryptosystems based on hyperelliptic curves. In particular we cover the implementation of the group law on such curves and how to genera...
ACISP
2004
Springer
14 years 1 months ago
2004
Springer
In this paper, we study the problem of single database private information retrieval, and present schemes with only logarithmic server-side communication complexity. Previously th...