Sciweavers

242 search results - page 6 / 49
» Practical Digital Signature Generation Using Biometrics
Sort
View
CONEXT
2007
ACM
13 years 9 months ago
Detecting worm variants using machine learning
Network intrusion detection systems typically detect worms by examining packet or flow logs for known signatures. Not only does this approach mean worms cannot be detected until ...
Oliver Sharma, Mark Girolami, Joseph S. Sventek
ASIACRYPT
2006
Springer
13 years 11 months ago
Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
Non-interactive zero-knowledge proofs play an essential role in many cryptographic protocols. We suggest several NIZK proof systems based on prime order groups with a bilinear map...
Jens Groth
PROVSEC
2010
Springer
13 years 5 months ago
Efficient Confirmer Signatures from the "Signature of a Commitment" Paradigm
Generic constructions of designated confirmer signatures follow one of the following two strategies; either produce a digital signature on the message to be signed, then encrypt th...
Laila El Aimani
IJNSEC
2008
154views more  IJNSEC 2008»
13 years 7 months ago
ID-based Weak Blind Signature From Bilinear Pairings
In a blind signature scheme, the user can get a signature sig(m) on message m generated from the signer's blind signature sig(m ) on blinded message m , but the signer can�...
Ze-mao Zhao
GLOBECOM
2006
IEEE
14 years 1 months ago
Bank Transfer over Quantum Channel with Digital Checks
- In recent years, many quantum cryptographic schemes have been proposed. However, it seems that there are many technical difficulties to realize them (except Quantum Key Distribut...
Yoshito Kanamori, Seong-Moo Yoo, Frederick T. Shel...