Sciweavers

401 search results - page 31 / 81
» Delegatable Functional Signatures
Sort
View
DCC
2003
IEEE
14 years 7 months ago
The Insecurity of the Elliptic Curve Digital Signature Algorithm with Partially Known Nonces
Nguyen and Shparlinski recently presented a polynomial-time algorithm that provably recovers the signer's secret DSA key when a few bits of the random nonces k (used at each s...
Phong Q. Nguyen, Igor Shparlinski
CIKM
2009
Springer
14 years 2 months ago
AS-index: a structure for string search using n-grams and algebraic signatures
AS-Index is a new index structure for exact string search in disk resident databases. It uses hashing, unlike known alternate structures, tree or trie based, and indexes every n-g...
Cédric du Mouza, Witold Litwin, Philippe Ri...
CHES
2009
Springer
141views Cryptology» more  CHES 2009»
14 years 8 months ago
Fault Attacks on RSA Signatures with Partially Unknown Messages
Fault attacks exploit hardware malfunctions to recover secrets from embedded electronic devices. In the late 90's, Boneh, DeMillo and Lipton [6] introduced fault-based attacks...
Jean-Sébastien Coron, Antoine Joux, Ilya Ki...
KBSE
2009
IEEE
14 years 2 months ago
Generating Vulnerability Signatures for String Manipulating Programs Using Automata-Based Forward and Backward Symbolic Analyses
Given a program and an attack pattern (specified as a regular expression), we automatically generate string-based vulnerability signatures, i.e., a characterization that includes...
Fang Yu, Muath Alkhalaf, Tevfik Bultan
ASAP
2006
IEEE
110views Hardware» more  ASAP 2006»
14 years 1 months ago
Low-Cost Elliptic Curve Digital Signature Coprocessor for Smart Cards
This paper proposes different low-cost coprocessors for public key authentication on 8-bit smart cards. Elliptic curve cryptography is used for its efficiency per bit of key and ...
Guerric Meurice de Dormale, Renaud Ambroise, David...