Sciweavers

116 search results - page 4 / 24
» A Security Model for Anonymous Credential Systems
Sort
View
CCS
2008
ACM
13 years 9 months ago
Efficient attributes for anonymous credentials
We extend the Camenisch-Lysyanskaya anonymous credential system such that selective disclosure of attributes becomes highly efficient. The resulting system significantly improves ...
Jan Camenisch, Thomas Groß
IJNSEC
2008
112views more  IJNSEC 2008»
13 years 7 months ago
A New and Efficient Signature on Commitment Values
We present a new short signature scheme based on a variant of the Boneh-Boyen's short signatures schemes. Our short signature scheme is secure without requiring the random or...
Fangguo Zhang, Xiaofeng Chen, Yi Mu, Willy Susilo
PET
2010
Springer
13 years 11 months ago
Making a Nymbler Nymble Using VERBS
In this work, we propose a new platform to enable service providers, such as web site operators, on the Internet to block past abusive users of anonymizing networks (for example, T...
Ryan Henry, Kevin Henry, Ian Goldberg
ACSAC
2004
IEEE
13 years 11 months ago
Securing a Remote Terminal Application with a Mobile Trusted Device
Many real-world applications use credentials such as passwords as means of user authentication. When accessed from untrusted public terminals, such applications are vulnerable to ...
Alina Oprea, Dirk Balfanz, Glenn Durfee, Diana K. ...
CTRSA
2005
Springer
221views Cryptology» more  CTRSA 2005»
14 years 26 days ago
Accumulators from Bilinear Pairings and Applications
We propose a dynamic accumulator scheme from bilinear pairings, whose security is based on the Strong Diffie-Hellman assumption. We show applications of this accumulator in constru...
Lan Nguyen