Sciweavers

315 search results - page 61 / 63
» Number Theoretic Attacks on Secure Password Schemes
Sort
View
CTRSA
2009
Springer
141views Cryptology» more  CTRSA 2009»
13 years 11 months ago
Practical Short Signature Batch Verification
In many applications, it is desirable to work with signatures that are both short, and yet where many messages from different signers be verified very quickly. RSA signatures sati...
Anna Lisa Ferrara, Matthew Green, Susan Hohenberge...
ACSC
2005
IEEE
14 years 1 months ago
Dependable Dynamic Source Routing without a Trusted Third Party
Ad-hoc networks are frequently used to establish communication in improvised environments without requiring any fixed infrastructure. These networks are formed with the help of t...
Asad Amir Pirzada, Chris McDonald, Amitava Datta
SAC
2009
ACM
14 years 2 months ago
Defending online reputation systems against collaborative unfair raters through signal modeling and trust
Online feedback-based rating systems are gaining popularity. Dealing with collaborative unfair ratings in such systems has been recognized as an important but difficult problem. T...
Yafei Yang, Yan Lindsay Sun, Steven Kay, Qing Yang
LATINCRYPT
2010
13 years 6 months ago
On the Impossibility of Batch Update for Cryptographic Accumulators
Abstract. A cryptographic accumulator is a scheme where a set of elements is represented by a single short value. This value, along with another value called witness, allows to pro...
Philippe Camacho, Alejandro Hevia
ASIACRYPT
2003
Springer
14 years 25 days ago
The Insecurity of Esign in Practical Implementations
Provable security usually makes the assumption that a source of perfectly random and secret data is available. However, in practical applications, and especially when smart cards a...
Pierre-Alain Fouque, Nick Howgrave-Graham, Gwena&e...