Security of BLS and BGLS signatures in a multi-user setting

Lacharité, Marie-Sarah

doi:10.1007/s12095-017-0253-6

Cited by 13 publications

(7 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The multi-party ElGamal and Schnorr based signature for authentication proposed by [50] achieved multi-party computation across the unauthentic channel. [51] proposed a new Secret Handshake scheme with a Multi-Symptom Intersection derived from a Schnorr signature. They authorised Private Set Intersection only if their target authentication policies are satisfied to execute.…”

Section: Schnorr's Signature For Multi-signaturementioning

confidence: 99%

An empirical study to demonstrate that EdDSA can be used as a performance improvement alternative to ECDSA in Blockchain and IoT

Jayabalasamy

Koppu

2022

IJCAI

View full text Add to dashboard Cite

Digital signatures are a vital part of the digital world. The trust factor in the digital world is ensured with a digital signature. Over the evolution, the purpose remained constant, but the applicability and frontier continued to evolve, thus raising the demand for continuous performance, security level and computational improvement. Especially with emerging IoT, blockchain and cryptocurrency, the digital signature security level and performance improvement demand continue to rise. A digital signature scheme (DSS) is used to generate signatures. This paper investigates the widely used elliptic curve digital signature algorithm (ECDSA) and its application to blockchain and IoT. Then, we performed an empirical comparison of ECDSA with the Edwards curve digital signature algorithm (EdDSA). The study concludes by showing that EdDSA is superior to ECDSA and can be applied in blockchain and IoT domains to reap immediate benefits.Povzetek: Avtorja primerjata dve metodi generiranja varnih digitalnih podpisov in pokažeta, da je EdDSA boljša kot ECDSA.

show abstract

Section: Schnorr's Signature For Multi-signaturementioning

confidence: 99%

An empirical study to demonstrate that EdDSA can be used as a performance improvement alternative to ECDSA in Blockchain and IoT

Jayabalasamy

Koppu

2022

IJCAI

View full text Add to dashboard Cite

show abstract

“…∈ , and the aggregated signature is vulnerable to rogue key [21] attacks. rogue key attack is an attack that uses special parameters to make the aggregated signature offset valid parameters 3.…”

Section: Security Analysismentioning

confidence: 99%

“…For any M, the malicious user II can calculate the aggregate signature declare that it is the valid aggregate signature of users I and II.Proof The proof process is shown in formula (3)[21].…”

mentioning

confidence: 99%

Trusted Blockchain Oracle Scheme Based on Aggregate Signature

Liu¹,

Feng²

2021

JCC

View full text Add to dashboard Cite

With the development of blockchain technology, more and more applications need out-of-chain data. Thus, blockchain oracles have become an important bridge for transferring data on and off the chain. This paper studies the mainstream blockchain oracles scheme, summarizes the shortcomings of the existing schemes and proposes a new blockchain oracle scheme based on BLS (Bohen-Lynn-Shacham) aggregation signature to ensure that off-chain data can be transferred into the blockchain in a trusted and reliable way. Specifically, the scheme uses multiple blockchain oracles to avoid the single point of failure or even a small number of malicious oracles, and improve the credibility of data. At the same time, it not only uses BLS aggregate signature to reduce the storage cost and communication overhead, but also uses commitment mechanisms to ensure the reliability and authenticity of the data. Besides, the simulation results show that the scheme can meet the practical application requirements.

show abstract

“…A bilinear pairing is a function e that maps G 1 × G 2 → G T , where G 1 and G 2 are groups of prime order based on the curve E over the finite field F q . This is Type-3 pairing and its security is determined by the hardness of the co-CDH assumption [34]. The following are properties of e: 1) Bilinearity:…”

Section: ) Bilinear Pairingmentioning

confidence: 99%

An Identity Based-Identification Scheme With Tight Security Against Active and Concurrent Adversaries

Chia

Chin

2020

IEEE Access

View full text Add to dashboard Cite

Identification schemes are used by machines to securely authenticate the identity of other machines or their users over computer networks. As conventional public key schemes require a trusted third party (TTP) or a public file to ensure the corresponding public key matches with the identity, identity-based cryptosystems emerged as a form of certificate-free system. The entity's identity is the public key itself, therefore eliminating the need for a TTP. The identity-based identification (IBI) scheme introduced by Kurosawa and Heng using their transform in 2004 remains as the only IBI derived from the Boneh-Lynn-Shacham (BLS) short signature scheme which has the advantage of shorter keys. We show tight security reduction against active and concurrent attackers (imp-aa/ca) on our scheme that is obtained from the same transform. As the transform will only produce schemes that are only secure against passive attackers (imp-pa), security against imp-aa/ca scheme relies on a strong One-More interactive assumption and therefore resulted in weak security. While the OR-proof method allows schemes secure against imp-pa to be secure against imp-aa/ca, the resulting security against imp-aa/ca will suffer from loose bounds in addition to the user secret keys being doubled in size. Our work avoids both OR-proof and strong interactive assumptions by showing an ad-hoc proof for our construction which utilizes the weaker well-studied co-computational Diffie-Hellman assumption and yet still has tight security against imp-aa/ca. We demonstrate the tight security of our scheme which allows usage of even shorter key sizes.

show abstract

Security of BLS and BGLS signatures in a multi-user setting

Cited by 13 publications

References 14 publications

An empirical study to demonstrate that EdDSA can be used as a performance improvement alternative to ECDSA in Blockchain and IoT

An empirical study to demonstrate that EdDSA can be used as a performance improvement alternative to ECDSA in Blockchain and IoT

Trusted Blockchain Oracle Scheme Based on Aggregate Signature

An Identity Based-Identification Scheme With Tight Security Against Active and Concurrent Adversaries

Contact Info

Product

Resources

About