Sciweavers

180 search results - page 24 / 36
» Discrete Logarithm Based Protocols
Sort
View
LATIN
2010
Springer
15 years 7 months ago
Modelling the LLL Algorithm by Sandpiles
Abstract The LLL algorithm aims at finding a “reduced” basis of a Euclidean lattice. The LLL algorithm plays a primary role in many areas of mathematics and computer science. ...
Manfred Madritsch, Brigitte Vallée
EUROCRYPT
2004
Springer
15 years 5 months ago
Projective Coordinates Leak
Denoting by P = [k]G the elliptic-curve double-and-add multiplication of a public base point G by a secret k, we show that allowing an adversary access to the projective representa...
David Naccache, Nigel P. Smart, Jacques Stern
CN
2006
66views more  CN 2006»
15 years 15 days ago
Secure acknowledgment aggregation and multisignatures with limited robustness
In certain reliable group-oriented and multicast applications, a source needs to securely verify whether all (and if not all, which) intended receivers have received a message. How...
Claude Castelluccia, Stanislaw Jarecki, Jihye Kim,...
IJNSEC
2011
239views more  IJNSEC 2011»
14 years 7 months ago
Digital Signature Scheme with Message Recovery Using Knapsack-based ECC
Digital signature authentication scheme provides secure communication between two users. Digital signatures guarantee end-to-end message integrity and authentication information a...
R. Rajaram Ramasamy, M. Amutha Prabakar
119
Voted
ASIACRYPT
2010
Springer
14 years 10 months ago
Lattice-Based Blind Signatures
Blind signatures (BS), introduced by Chaum, have become a cornerstone in privacy-oriented cryptography. Using hard lattice problems, such as the shortest vector problem, as the bas...
Markus Rückert