Sciweavers

488 search results - page 60 / 98
» Policy-Based Cryptography and Applications
Sort
View
IACR
2011
146views more  IACR 2011»
12 years 8 months ago
Identity-based Digital Signature Scheme Without Bilinear Pairings
: Many identity-based digital signature schemes using bilinear pairings have been proposed. But the relative computation cost of the pairing is approximately twenty times higher th...
Debiao He, Jianhua Chen, Jin Hu
EUROCRYPT
2012
Springer
11 years 11 months ago
Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
Decoding random linear codes is a well studied problem with many applications in complexity theory and cryptography. The security of almost all coding and LPN/LWE-based schemes rel...
Anja Becker, Antoine Joux, Alexander May, Alexande...
ICSE
2008
IEEE-ACM
14 years 9 months ago
Static detection of cross-site scripting vulnerabilities
Web applications support many of our daily activities, but they often have security problems, and their accessibility makes them easy to exploit. In cross-site scripting (XSS), an...
Gary Wassermann, Zhendong Su
ACNS
2005
Springer
134views Cryptology» more  ACNS 2005»
14 years 2 months ago
Dynamic k-Times Anonymous Authentication
k-times anonymous authentication (k-TAA) schemes allow members of a group to be anonymously authenticated by application providers for a bounded number of times. k-TAA has applicat...
Lan Nguyen, Reihaneh Safavi-Naini
SCN
2010
Springer
147views Communications» more  SCN 2010»
13 years 6 months ago
Group Message Authentication
Group signatures is a powerful primitive with many practical applications, allowing a group of parties to share a signature functionality, while protecting the anonymity of the si...
Bartosz Przydatek, Douglas Wikström