Sciweavers

2601 search results - page 393 / 521
» Secure Rewarding Schemes
Sort
View
EUROCRYPT
2010
Springer
15 years 8 months ago
Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups
We develop an abstract framework that encompasses the key properties of bilinear groups of composite order that are required to construct secure pairing-based cryptosystems, and we...
David Mandell Freeman
ACNS
2004
Springer
133views Cryptology» more  ACNS 2004»
15 years 7 months ago
Limited Verifier Signature from Bilinear Pairings
Motivated by the conflict between authenticity and privacy in the digital signature, the notion of limited verifier signature was introduced [1]. The signature can be verified by a...
Xiaofeng Chen, Fangguo Zhang, Kwangjo Kim
ACSAC
2004
IEEE
15 years 7 months ago
Visualizing and Identifying Intrusion Context from System Calls Trace
Anomaly-based Intrusion Detection (AID) techniques are useful for detecting novel intrusions without known signatures. However, AID techniques suffer from higher false alarm rate ...
Zhuowei Li, Amitabha Das
FC
2000
Springer
150views Cryptology» more  FC 2000»
15 years 6 months ago
Self-Scrambling Anonymizers
For the two last decades, people have tried to provide practical electronic cash schemes, with more or less success. Indeed, the most secure ones generally suffer from inefficiency...
David Pointcheval
CCS
2008
ACM
15 years 5 months ago
Dependent link padding algorithms for low latency anonymity systems
Low latency anonymity systems are susceptive to traffic analysis attacks. In this paper, we propose a dependent link padding scheme to protect anonymity systems from traffic analy...
Wei Wang 0002, Mehul Motani, Vikram Srinivasan