Holger Petersen, Markus Michels  Home/Search
Context
Related
| geocities.com/CapeCan...PBTNVeri.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cryptosoft.com/html/secpub (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . While in the ordinary digital signature concept one verifier is sufficient to check the validity of a given signature, there are situations in which only t out of a group of n verifiers should be able to verify the signatures. These verifiers can either be anonymous, non-anonymous or convertible non-anonymous. So far, only schemes for the anonymous shared verification signature concept have been suggested. However, they suffer from different drawbacks, especially the security relies on the... (Update)
Similar documents (at the sentence level):
37.0%: On Signature Schemes With Threshold Verification Detecting.. - Petersen, Michels (1997) (Correct)
Active bibliography (related documents): More All
0.4: Self-certified keys - Concepts and Applications - Petersen, Horster (1997) (Correct)
0.3: Generalized Signature Schemes With (t,n) Shared.. - Horster, Michels.. (1994) (Correct)
0.3: Receipt-Free Homomorphic Elections and Write-in Ballots - Acquisti (2004) (Correct)
Similar documents based on text: More All
0.3: Breaking and Repairing a Convertible Undeniable Signature.. - Michels, Petersen, Horster (1996) (Correct)
0.2: On the Role of Shared Randomness in Two Prover Proof Systems - Bellare, Feige, Kilian (1995) (Correct)
0.2: Proposal on Taxation of Electronic Commerceto the US Advisory.. - Peha (1999) (Correct)
BibTeX entry: (Update)
@inproceedings{ petersen97signature,
author = "Holger Petersen and Markus Michels",
title = "On Signature Schemes with Threshold Verification Detecting Malicious Verifiers",
booktitle = "Security Protocols Workshop",
pages = "67-78",
year = "1997",
url = "citeseer.ist.psu.edu/petersen97signature.html" }
Citations (may not include all citations):645 How to share a secret (context) - Shamir - 1981
601 A public key cryptosystem and a signature scheme based on di.. (context) - ElGamal - 1985
193 Threshold cryptosystems (context) - Desmedt, Frankel - 1991
166 Wallet databases with observers (context) - Chaum, Pedersen - 1993
147 Efficient signature generation by smart cards (context) - Schnorr - 1991
120 Robust Threshold DSS Signatures - Gennaro, Jarecki et al. - 1996
89 A threshold Cryptosystem without a Trusted Party (context) - Pedersen - 1992
88 Undeniable Signatures (context) - Chaum, van Antwerpen - 1990
84 Society and group oriented cryptography : a new concept (context) - Desmedt - 1988
57 Distributed Provers with Applications to Undeniable Signatur.. (context) - Pedersen - 1992
39 Meta-ElGamal signature schemes - Horster, Michels et al. - 1994
23 New ElGamal Type Threshold Digital Signature Scheme - Park, Kurosawa - 1996
14 Security Proofs for Signatures (context) - Pointcheval, Stern - 1996
9 Verifiable signature sharing (context) - Franklin, Reiter - 1996
4 Directed Signatures and Applications to Threshold Cryptosyst.. - Lim, Lee - 1997
3 Blind multisignature schemes and their relevance to electron.. (context) - Horster, Michels et al. - 1995
3 A signature with shared verification scheme (context) - de Soete, Quisquater et al. - 1990
2 Electronics Letters (context) - Harn, to - 1995
2 Algorithmic measures for preventing middleperson attack in i.. (context) - Lim, Lee - 1993
2 Comment: Digital signature with (t; n) shared verification b.. (context) - Lee, Chang - 1995
2 Comment: Digital signature with (t; n) shared verification (context) - Horster, Michels et al. - 1995
1 Das Meta-ElGamal Signaturverfahren und seine Anwendungen (context) - Horster, Michels et al. - 1995
Documents on the same site (http://www.cryptosoft.com/html/secpub.htm): More
A New Approach for Delegation Using Hierarchical Delegation.. - Ding, Petersen (1995) (Correct)
A Uniform-Complexity Treatment of Encryption and Zero-Knowledge - Goldreich (1991) (Correct)
Efficient Cryptographic Schemes Provably as Secure as Subset Sum - Impagliazzo, Naor (1996) (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