Tightly-Secure Identity-Based Structured Aggregate Signature Scheme under the Computational Diffie-Hellman Assumption

Iwasaki, Tomoya; Yanai, Naoto; Inamura, Masaki; Iwamura, Keiichi

doi:10.1109/aina.2016.99

Cited by 10 publications

(5 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Hashimoto and Ogata [6] proposed the frst unrestricted and compact aggregated signature scheme, in which the signature size is constant, and the generated pair signatures can have diferent information states and can aggregate any combination of signatures. Iwasaki et al [7] extended from the two perspectives of structured signature and identitybased signature and constructed an identity-based structured aggregated signature scheme, and the security of the scheme will not be reduced due to the ability of the adversary. It can successfully defend against switching attacks (CCS 2007, Boldyreva et al [8]) and reordering attacks (ISPEC 2007, Shao [9]).…”

Section: Related Workmentioning

confidence: 99%

New Constructions of Existential Unforgeable Aggregate Signature Scheme from CSP

Zou

Huang

et al. 2022

Security and Communication Networks

View full text Add to dashboard Cite

In future, hundreds of years of mathematical problems that the security of public key cryptography algorithms rely on may be defeated by quantum algorithms. How can a digital signature scheme gracefully balance security and efficiency? This study uses the conjugate search problem and the left self-distributive system to combine and uses the RSA-like algorithm as the underlying structure to propose a new aggregated signature scheme. We, through the EUF game, under the random metaphor model, prove that the security of the scheme satisfies the adaptation unforgeability under selective message attack, the scheme can be finally reduced to the discrete logarithm problem or large prime number decomposition problem. In addition, we can achieve antiquantum attack and exhaustive attack by performing matrix calculations on the message, defining and changing the structure of the matrix by encoding, and setting thresholds for the matrix dimension and the length of the private key. In terms of efficiency, the message signature implementation is linear compared with the expansion rate in terms of storage and computing overhead, and the generation and verification of the final signature pair have nothing to do with the number of users. In addition, the length of the signature is fixed and the size is only the length of a single group, which effectively reduces the generation of public and private key pairs and saves a lot of storage space. The storage space and computational complexity are also effectively improved compared with other solutions.

show abstract

Section: Related Workmentioning

confidence: 99%

New Constructions of Existential Unforgeable Aggregate Signature Scheme from CSP

Zou

Huang

et al. 2022

Security and Communication Networks

View full text Add to dashboard Cite

show abstract

“…Definition 3 (Computation Diffie-Hellman Assumption [22]): Let us random choose a, b ∈ Z * q , compute g ab based on a predefined triple couple (g, g a , g b ). [22]): Let us random choose a, b, c ∈ Z * q , R ∈ G 2 , and judge whether equation e(g, g) abc = R is valid or not based on a preset triple couple (g, g a , g b , g c , R).…”

Section: ) Development Of Abementioning

confidence: 99%

“…2) Searchable asymmetric encryption (SAE): SAE is suitable for one-to-many data sharing scenarios based on public key encryption systems. Its security is based on different assumptions, such as, Decision Bilinear Diffie-Hellman (DBDH) [22]. Because SAE scheme is usually inefficient based on bilinear pairings, which leads to high complexity of the algorithm, because of the separation of public key and private key, it still very suitable for multi-user data sharing system.…”

Section: ) Encryptionmentioning

confidence: 99%

Privacy Protection and Data Security in Cloud Computing: A Survey, Challenges, and Solutions

Sun

2019

IEEE Access

View full text Add to dashboard Cite

Privacy and security are the most important issues to the popularity of cloud computing service. In recent years, there are many research schemes of cloud computing privacy protection based on access control, attribute-based encryption (ABE), trust and reputation, but they are scattered and lack unified logic. In this paper, we systematically review and analyze relevant research achievements. First, we discuss the architecture, concepts and several shortcomings of cloud computing, and propose a framework of privacy protection; second, we discuss and analyze basic ABE, KP-ABE (key policy attribute-based encryption), CP-ABE (ciphertext policy attribute-based encryption), access structure, revocation mechanism, multiauthority, fine-grained, trace mechanism, proxy re-encryption(PRE), hierarchical encryption, searchable encryption(SE), trust, reputation, extension of tradition access control and hierarchical key; third, we propose the research challenge and future direction of the privacy protection in the cloud computing; finally, we point out corresponding privacy protection laws to make up for the technical deficiencies. INDEX TERMS Cloud computing, privacy, access control, attribute-based encryption, trust.

show abstract

“…. ( 1 , 2 , ⋅ ⋅ ⋅ , ( −1) ) do not lie in the common (t-2)-dimensional space, then they can uniquely determine a sphere, described as (5)…”

Section: Implement Algorithm Describedmentioning

confidence: 99%

“…Concerning the basic theory group authentications fall into two categories: based on public key system and not based on public key system. In group authentication based on public key system [3][4][5][6][7], each member makes the individual signature by its private key and delivers its own signature to the aggregator, who is the selected one of group members. After receiving other signatures the aggregator compresses all signatures by the aggregate algorithms.…”

Section: Introductionmentioning

confidence: 99%

Asynchronous Group Authentication Based on Geometric Approach

Wang

Zhu

et al. 2018

Security and Communication Networks

View full text Add to dashboard Cite

Individual authentication in air warfare is used to check whether a single participant is a legal member of the predefined group but not determine all participants at one time. An asynchronous (m, t, n) group authentication protocol is proposed based on multidimensional sphere reconstruction theorem of space analytic geometry without making any computational assumption, where m is the number of participants, t is threshold value, and n is the number of members. The proposed protocol can determine whether all participants belong to the predefined group at one time, which is applicable to batch verification prior to individual authentication. The center's coordinate of ( − 1)-dimensional sphere is treated as the shared secret and the coordinate of the point on the surface of the sphere, multiplied by a random blind factor, is issued to all members as their tokens. If m participants can reconstruct the shared secret by utilizing their tokens, indicate that there is not any invalid participant, otherwise perform individual authentication. Analyses show the proposed scheme can not only rule out the illegal outsider but also resist up to −1 group member conspiring to forge a valid token for an outsider. In addition, compared with other schemes the proposed scheme is more applicable for air warfare network, with light-weight computation, flexible distribution, and high information rate.

show abstract

Tightly-Secure Identity-Based Structured Aggregate Signature Scheme under the Computational Diffie-Hellman Assumption

Cited by 10 publications

References 17 publications

New Constructions of Existential Unforgeable Aggregate Signature Scheme from CSP

New Constructions of Existential Unforgeable Aggregate Signature Scheme from CSP

Privacy Protection and Data Security in Cloud Computing: A Survey, Challenges, and Solutions

Asynchronous Group Authentication Based on Geometric Approach

Contact Info

Product

Resources

About