An efficient ring signature scheme from pairings

DOI10.1016/J.INS.2014.12.019zbMath1360.94353OpenAlexW1976636397MaRDI QIDQ528720

Kyung-Ah Shim

Publication date: 16 May 2017

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2014.12.019

zbMATH Keywords

digital signaturerandom oracle modelbilinear pairingco-computational Diffie-Hellman assumptionring signature

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Related Items (3)

Traceable policy-based signatures and instantiation from lattices ⋮ A certificateless ring signature scheme with high efficiency in the random oracle model ⋮ A generic framework for accountable optimistic fair exchange protocol

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient pairing computation on supersingular abelian varieties
• Elliptic curves suitable for pairing based cryptography
• Designated Verifier Proofs and Their Applications
• Faster Explicit Formulas for Computing Pairings over Ordinary Curves
• Diffie-Hellman Oracles
• Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups
• A CDH-Based Ring Signature Scheme with Short Signatures and Public Keys
• Efficient Identity Based Ring Signature
• Group Signatures
• 1-out-of-n Signatures from a Variety of Keys
• Advances in Cryptology - EUROCRYPT 2004
• Pairing-Friendly Elliptic Curves of Prime Order
• Progress in Cryptology - INDOCRYPT 2003
• Finding Collisions in the Full SHA-1
• Selected Areas in Cryptography
• Efficient Ring Signatures Without Random Oracles
• Theory of Cryptography
• Algorithmic Number Theory
• Public Key Cryptography – PKC 2004

This page was built for publication: An efficient ring signature scheme from pairings