(Enter summary)
Abstract: Formal models and security proofs are especially important for multisignatures: in contrast to threshold
signatures, no precise definitions were ever provided for such schemes, and some proposals were
subsequently broken. (Update)
Cited by: More
Sequential Aggregate Signatures and.. - Lu, Ostrovsky.. (2006)
(Correct)
Online/Oine Signatures and Multisignatures for AODV and - Dsr Routing Security (2006)
(Correct)
Proxy Re-Signatures: New Definitions, Algorithms, and.. - Ateniese, Hohenberger (2005)
(Correct)
Similar documents (at the sentence level):
61.5%: Accountable-Subgroup Multisignatures - Ohta, Micali, Reyzin (2000)
(Correct)
Active bibliography (related documents): More All
0.8: Efficient Threshold Signature, Multisignature and Blind.. - Boldyreva (2002)
(Correct)
0.5: On the Security of the Li-Hwang-Lee-Tsai Threshold Group Signature .. - Wang
(Correct)
0.4: Crypto Topics And Applications II - Seberry, Charnes, Pieprzyk..
(Correct)
Similar documents based on text: More All
0.4: Soundness in the Public-Key Model - Micali, Reyzin (2001)
(Correct)
0.3: Min-Round Resettable Zero Knowledge In The Public Key Model - Micali, Reyzin (2000)
(Correct)
0.3: Zero-Knowledge with Public Keys - Reyzin (2001)
(Correct)
Related documents from co-citation: More All
10: Short signatures from the Weil pairing
- Boneh, Lynn et al. - 2001
8: Multi-signature schemes secure against active insider attacks (context) - Ohta, Okamoto - 1999
7: Secure border gateway protocol (context) - Kent, Lynn et al. - 2000
BibTeX entry: (Update)
S. Micali, K. Ohta and L. Reyzin, \Accountable-subgroup multisignatures," ACM Conference on Computer and Communications Security, 2001. http://citeseer.ist.psu.edu/ohta00accountablesubgroup.html More
@misc{ micali01accountablesubgroup,
author = "S. Micali and K. Ohta and L. Reyzin",
title = "Accountable-subgroup multisignatures",
text = "S. Micali, K. Ohta and L. Reyzin, \Accountable-subgroup multisignatures,
ACM Conference on Computer and Communications Security, 2001.",
year = "2001",
url = "citeseer.ist.psu.edu/ohta00accountablesubgroup.html" }
Citations (may not include all citations):
659
Random oracles are practical: A paradigm for designing e#cie..
- Bellare, Rogaway - 1993
411
How to prove yourself: Practical solutions to identification..
- Fiat, Shamir - 1986
287
Multiparty unconditionally secure protocols (context) - Chaum, Crepeau et al.
206
Zero-knowledge proofs of identity (context) - Feige, Fiat et al. - 1988
193
Threshold cryptosystems (context) - Desmedt, Frankel
165
Security proofs for signature schemes
- Pointcheval, Stern
154
Group signatures (context) - Chaum, van Heyst
140
How to play any mental game or a completeness theorem for pr.. (context) - Goldreich, Micali et al. - 1987
120
Robust threshold DSS signatures
- Gennaro, law et al.
116
volume 547 of Lecture Notes in Computer Science (context) - Davies, in - 1991
116
volume 1109 of Lecture Notes in Computer Science (context) - Koblitz, in - 1996
116
volume 1070 of Lecture Notes in Computer Science (context) - Maurer, in - 1996
104
A certified digital signature (context) - Merkle
69
Secure distributed key generation for discrete-log based cry..
- Gennaro, law et al. - 1999
56
cient group signature schemes for large groups (context) - Camenisch, Stadler - 1997
31
On concrete security treatment of signatures derived from id..
- Ohta, Okamoto - 1998
29
How to generate factored random numbers (context) - Bach - 1988
17
Meta-multisignatures schemes based on the discrete logarithm..
- Horster, Michels et al. - 1995
16
cient sharing of RSA functions (context) - Gennaro, law et al.
16
Multi-signature schemes secure against active insider attack.. (context) - Ohta, Okamoto - 1999
14
volume 435 of Lecture Notes in Computer Science (context) - Brassard, in - 1989
12
A public-key cryptosystem suitable for digital multisignatur.. (context) - Itakura, Nakamura - 1983
11
threshold digital signature scheme and digital multisignatur.. (context) - Harn - 1994
9
A digital multisignature scheme based on the Fiat-Shamir sch.. (context) - Ohta, Okamoto - 1991
9
Threshold-multisignature schemes where suspected forgery imp.. (context) - Li, Hwang et al. - 1994
8
A threshold cryptosystem without a trusted party (context) - Pedersen
6
SIAM Journal on Computing (context) - Micali - 2000
5
Weaknesses in some threshold cryptosystems (context) - Langford
4
the risk of disruption in several multiparty signature schem..
- Michels, Horster - 1996
3
A digital multisignature schema using bijective public-key c.. (context) - Okamoto - 1988
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://theory.lcs.mit.edu/%7Ecis/cis-publications.html): More
"Pseudo-Random" Number Generation within.. - Bellare, Goldwasser, .. (1997)
(Correct)
Can We Eliminate Certificate Revocation Lists? - Rivest (1998)
(Correct)
The Shortest Vector in a Lattice is Hard to Approximate to.. - Micciancio (1998)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC