Unconditionally-Secure Digital Signatures

Chaum, David; Roijakkers, Sandra

doi:10.1007/3-540-38424-3_15

Cited by 58 publications

(57 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…This is very important when one wants to achieve unconditional security. In the case of classical protocols, digital pseudo-signatures [10] should be used, where key is one-use and expensive to generate. Finally, our protocol can be used in solving some purely quantum protocols involving timely decisions between spatially distant parties, such was the case of simultaneous dense coding and teleportation [11].…”

Section: Introductionmentioning

confidence: 99%

Fair and optimistic quantum contract signing

2011

View full text Add to dashboard Cite

We present a fair and optimistic [7,8] quantum contract signing protocol between two clients that requires no communication with the third trusted party during the exchange phase. We discuss its fairness and show that it is possible to design such a protocol for which the probability of a dishonest client to cheat becomes negligible, and scales as N −1/2 , where N is the number of messages exchanged between the clients. Our protocol is not based on the exchange of signed messages: its fairness is based on the laws of quantum mechanics. Thus, it is abuse-free [9], and the clients do not have to generate new keys for each message during the Exchange phase. We discuss a real-life scenario when the measurement errors and qubit state corruption due to noisy channels occur and argue that for real, good enough measurement apparatus and transmission channels, our protocol would still be fair. Our protocol could be implemented by today's technology, as it requires in essence the same type of apparatus as the one needed for BB84 cryptographic protocol [12]. Finally, we briefly discuss two alternative versions of the protocol, one that uses only two states (based on B92 protocol [24]) and the other that uses entangled pairs (based on [20]), and show that it is possible to generalize our protocol to an arbitrary number of clients.

show abstract

Section: Introductionmentioning

confidence: 99%

Fair and optimistic quantum contract signing

2011

View full text Add to dashboard Cite

show abstract

“…The first unconditionally secure signature was proposed by Chaum and Roijakkers [5]. There have been many attempts to enhance conventional unconditionally secure authentication codes [13] [27] with extra security-properties that are required by signature schemes.…”

Section: Introductionmentioning

confidence: 99%

Security Notions for Unconditionally Secure Signature Schemes

Shikata

Hanaoka

Zheng

et al. 2002

Advances in Cryptology — EUROCRYPT 2002

View full text Add to dashboard Cite

Abstract. This paper focuses on notions for the security of digital signature schemes whose resistance against forgery is not dependent on unproven computational assumptions. We establish successfully a sound and strong notion for such signature schemes. We arrive at the sound notion by examining carefully the more established security notions for digital signatures based on public-key cryptography, and taking into account desirable requirements of signature schemes in the unconditional security setting. We also reveal an interesting relation among relevant security notions which have appeared in the unconditionally setting, and significantly, prove that our new security notion is the strongest among all those for unconditionally secure authentication and signature schemes known to date. Furthermore, we show that our security notion encompasses that for public-key signature schemes, namely, existential unforgeability under adaptive chosen-message attack. Finally we propose a construction method for signature schemes that are provably secure in our strong security notion.

show abstract

“…The proofs follow in the same way as with a randomly chosen matrix but with an extra hybrid step to go from random matrix elements to matrix elements generated by a pseudorandom function. 9 The cost of generating a signature can be reduced further. Gen AS can produce a prefactored matrix (using the LU factorization, for instance) for use by Sign AS on the righthand side of (1).…”

Section: λ-Completenessmentioning

confidence: 99%

“…λ-Limited Transferability Chaum and Roijakkers [9] were the first to suggest constructing tags that could be transferred a finite number of times. Their scheme allows signed messages to be transferred only once.…”

Section: Related Workmentioning

confidence: 99%

“…The idea of constructing signature schemes in a secret-key setting began with Chaum and Roijakkers [9]. However, none of that work or its successors (e.g., [18,19,24,27,29]) satisfies fully adaptive security-that unforgeability holds even with respect to an adversary that can see an a priori unbounded number of signatures on messages of its choice.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Multi-Verifier Signatures

2011

View full text Add to dashboard Cite

Abstract. Multi-verifier signatures generalize public-key signatures to a secret-key setting. Just like public-key signatures, these signatures are both transferable and secure under arbitrary (unbounded) adaptive chosen-message attacks. In contrast to public-key signature schemes, however, we exhibit practical constructions of multi-verifier signature schemes that are provably secure and are based only on pseudorandom functions in the plain model without any random oracles.

show abstract

Unconditionally-Secure Digital Signatures

Cited by 58 publications

References 9 publications

Fair and optimistic quantum contract signing

Fair and optimistic quantum contract signing

Security Notions for Unconditionally Secure Signature Schemes

Multi-Verifier Signatures

Contact Info

Product

Resources

About