Security Notions for Unconditionally Secure Signature Schemes

Shikata, Junji; Hanaoka, Goichiro; Zheng, Yuliang; Imai, Hideki

doi:10.1007/3-540-46035-7_29

Cited by 36 publications

(44 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For instance, recent work [18,27,29] generalizes Multi-Receiver Authentication (MRA) codes (invented by Desmedt et al [11]) to unconditionally-secure polynomial codes that satisfy similar properties to Transferability. These constructions are called MRA 3 codes.…”

Section: Related Workmentioning

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

Section: Related Workmentioning

confidence: 99%

“…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. In modern network environments, supporting adaptive security is important.…”

Section: Introductionmentioning

confidence: 99%

Multi-Verifier Signatures

2011

View full text Add to dashboard Cite

show abstract

“…no anonymity. Though there are some unconditionally secure digital signature schemes [19,20,26] that do exist, these schemes yet too, do not provide anonymity. However, in computationally secure settings, anonymity can be achieved by using group signatures [11,8].…”

Section: Related Workmentioning

confidence: 99%

Unconditionally Secure Anonymous Encryption and Group Authentication

Hanaoka

Shikata

Hanaoka³

et al. 2002

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract.Anonymous channels or similar techniques that can achieve sender's anonymity play important roles in many applications. However, they will be meaningless if cryptographic primitives containing his identity is carelessly used during the transmission. The main contribution of this paper is to study the security primitives for the above problem. In this paper, we first define unconditionally secure asymmetric encryption scheme (USAE), which is an encryption scheme with unconditional security and is impossible for a receiver to deduce the identity of a sender from the encrypted message. We also investigate tight lower bounds on required memory sizes from an information theoretic viewpoint and show an optimal construction based on polynomials. We also show a construction based on combinatorial theory, a non-malleable scheme and a multi-receiver scheme. Then, we define and formalize group authentication code (GA-code), which is an unconditionally secure authentication code with anonymity like group signatures. In this scheme, any authenticated user will be able to generate and send an authenticated message while the receiver can verify the legitimacy of the message that it has been sent from a legitimate user but at the same time retains his anonymity. For GA-code, we show two concrete constructions.

show abstract

“…That is, it is important to distinguish between signatures that are created using a user's signing algorithm and signatures that may satisfy one or more user verification algorithms. Current research [5,6,10,12,7] has proposed various models for unconditionally secure signature schemes, but these models do not fully treat the implications of having multiple verification algorithms or analyze the need for (and trust questions associated with) having a dispute resolution mechanism. We address both of these issues in this paper.…”

Section: Introductionmentioning

confidence: 99%

“…Shikata et al [12] introduced a model using notions from public-key cryptography, which was also adopted in the work by Hara et al [7] on blind signatures. Safavi-Naini et al [10] presented a MAC-based model meant to encompass the notions developed by Shikata et al In this work, we present a new security model.…”

Section: Introductionmentioning

confidence: 99%

Unconditionally secure signature schemes revisited

Swanson

Stinson

2016

Journal of Mathematical Cryptology

View full text Add to dashboard Cite

Abstract. Unconditionally secure signature (USS) schemes provide the ability to electronically sign documents without the reliance on computational assumptions needed in traditional digital signatures. Unlike digital signatures, USS schemes require both different signing and different verification algorithms for each user in the system. Thus, any viable security definition for a USS scheme must carefully treat the subject of what constitutes a valid signature. That is, it is important to distinguish between signatures that are created using a user's signing algorithm and signatures that may satisfy one or more user verification algorithms. Moreover, given that each verifier has his own distinct verification algorithm, a USS scheme must necessarily handle the event of a disagreement. In this paper, we present a new security model for USS schemes that incorporates these notions, as well as give a formal treatment of dispute resolution and the trust assumptions required. We provide formal definitions of non-repudiation and transferability in the context of dispute resolution, and give sufficient conditions for a USS scheme to satisfy these properties. Finally, we give an analysis of the construction of Hanaoka et al. in our security model.

show abstract

Security Notions for Unconditionally Secure Signature Schemes

Cited by 36 publications

References 30 publications

Multi-Verifier Signatures

Multi-Verifier Signatures

Unconditionally Secure Anonymous Encryption and Group Authentication

Unconditionally secure signature schemes revisited

Contact Info

Product

Resources

About