Sciweavers

58 search results - page 6 / 12
» A Practical and Provably Secure Coalition-Resistant Group Si...
Sort
View
CCS
2007
ACM
14 years 2 months ago
Provably secure ciphertext policy ABE
In ciphertext policy attribute-based encryption (CP-ABE), every secret key is associated with a set of attributes, and every ciphertext is associated with an access structure on a...
Ling Cheung, Calvin C. Newport
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...
FC
2006
Springer
153views Cryptology» more  FC 2006»
13 years 11 months ago
Revisiting Oblivious Signature-Based Envelopes
Secure, anonymous and unobservable communication is becoming increasingly important due to the gradual erosion of privacy in many aspects of everyday life. This prompts the need f...
Samad Nasserian, Gene Tsudik
ICICS
2004
Springer
14 years 1 months ago
Factorization-Based Fail-Stop Signatures Revisited
Fail-stop signature (FSS) schemes are important primitives because in a fail-stop signature scheme the signer is protected against unlimited powerful adversaries as follows: Even i...
Katja Schmidt-Samoa
ASIACRYPT
2001
Springer
13 years 11 months ago
Efficient Zero-Knowledge Authentication Based on a Linear Algebra Problem MinRank
A Zero-knowledge protocol provides provably secure entity authentication based on a hard computational problem. Among many schemes proposed since 1984, the most practical rely on f...
Nicolas Courtois