Sciweavers

255 search results - page 16 / 51
» Security of Encryption Schemes in Weakened Random Oracle Mod...
Sort
View
DCC
2010
IEEE
13 years 7 months ago
Comparing two pairing-based aggregate signature schemes
In 2003, Boneh, Gentry, Lynn and Shacham (BGLS) devised the first provably-secure aggregate signature scheme. Their scheme uses bilinear pairings and their security proof is in the...
Sanjit Chatterjee, Darrel Hankerson, Edward Knapp,...
ACNS
2004
Springer
131views Cryptology» more  ACNS 2004»
13 years 11 months ago
Evaluating Security of Voting Schemes in the Universal Composability Framework
In the literature, voting protocols are considered secure if they satisfy requirements such as privacy, accuracy, robustness, etc. It can be time consuming to evaluate a voting pr...
Jens Groth
IJNSEC
2006
113views more  IJNSEC 2006»
13 years 7 months ago
An Identity-based Mediated Signature Scheme from Bilinear Pairing
It has always been a critical issue to find efficient methods for fast revocation of a user's identity in identity (ID)based cryptosystems. Unfortunately, none of the previou...
Xiangguo Cheng, Lifeng Guo, Xinmei Wang
CCS
2006
ACM
13 years 11 months ago
Ring signatures without random oracles
Since the formalization of ring signature by Rivest, Shamir and Tauman in 2001, there are lots of variations appeared in the literature. Almost all of the variations rely on the ra...
Sherman S. M. Chow, Victor K.-W. Wei, Joseph K. Li...
WEWORC
2007
132views Cryptology» more  WEWORC 2007»
13 years 8 months ago
Towards a Concrete Security Proof of Courtois, Finiasz and Sendrier Signature Scheme
Abstract. Courtois, Finiasz and Sendrier proposed in 2001 a practical code-based signature scheme. We give a rigorous security analysis of a modified version of this scheme in the...
Léonard Dallot