Sciweavers

76 search results - page 3 / 16
» Confirmer Signature Schemes Secure against Adaptive Adversar...
Sort
View
ICISC
2001
98views Cryptology» more  ICISC 2001»
13 years 10 months ago
A Multi-signature Scheme with Signers' Intentions Secure against Active Attacks
In this paper, we propose a multi-signature scheme, in which each signer can express her intention associating with the message to be signed. Signers' intentions mean a kind o...
Kei Kawauchi, Hiroshi Minato, Atsuko Miyaji, Mitsu...
EUROCRYPT
2001
Springer
14 years 1 months ago
A Secure Three-Move Blind Signature Scheme for Polynomially Many Signatures
Abstract. Known practical blind signature schemes whose security against adaptive and parallel attacks can be proven in the random oracle model either need five data exchanges bet...
Masayuki Abe
ACNS
2004
Springer
131views Cryptology» more  ACNS 2004»
14 years 1 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
EUROCRYPT
2010
Springer
14 years 2 months ago
Encryption Schemes Secure against Chosen-Ciphertext Selective Opening Attacks
Imagine many small devices send data to a single receiver, encrypted using the receiver’s public key. Assume an adversary that has the power to adaptively corrupt a subset of the...
Serge Fehr, Dennis Hofheinz, Eike Kiltz, Hoeteck W...
ACNS
2008
Springer
132views Cryptology» more  ACNS 2008»
14 years 3 months ago
Generic Security-Amplifying Methods of Ordinary Digital Signatures
We describe two new paradigms on how to obtain ordinary signatures that are secure against existential forgery under adaptively chosen message attacks (fully-secure, in short), fro...
Jin Li, Kwangjo Kim, Fangguo Zhang, Duncan S. Wong