Ring Signatures: Stronger Definitions, and Constructions Without Random Oracles

Bender, Adam; Katz, Jonathan; Morselli, Ruggero

doi:10.1007/11681878_4

Cited by 231 publications

(134 citation statements)

References 17 publications

Supporting

Mentioning

134

Contrasting

Order By: Relevance

“…Their ring signature is built on top of signatures of knowledge and accumulators, following Dodis et al [9]. The scheme description is only sketched and no proof of security is given but, for fairness (as also noted in [24]), their work is previous to the (now standard) formal definition of ring signatures of Bender et al [2]. Anyway, signatures of knowledge are built on top of simulation sound NIZK which in turn is built from standard NIZK.…”

Section: Related Workmentioning

confidence: 99%

Shorter Ring Signatures from Standard Assumptions

González

2019

Public-Key Cryptography – PKC 2019

View full text Add to dashboard Cite

Ring signatures, introduced by Rivest, Shamir and Tauman (ASIACRYPT 2001), allow to sign a message on behalf of a set of users while guaranteeing authenticity and anonymity. Groth and Kohlweiss (EUROCRYPT 2015) and Libert et al. (EUROCRYPT 2016) constructed schemes with signatures of size logarithmic in the number of users. An even shorter ring signature, of size independent from the number of users, was recently proposed by Malavolta and Schröder (ASIACRYPT 2017). However, all these short signatures are obtained relying on strong and controversial assumptions. Namely, the former schemes are both proven secure in the random oracle model while the later requires non-falsifiable assumptions. The most efficient construction under mild assumptions remains the construction of Chandran et al. (ICALP 2007) with a signature of size Θ(√ n), where n is the number of users, and security is based on the Diffie-Hellman assumption in bilinear groups (the SXDH assumption in asymmetric bilinear groups). In this work we construct an asymptotically shorter ring signature from the hardness of the Diffie-Hellman assumption in bilinear groups. Each signature comprises Θ(3 √ n) group elements, signing a message requires computing Θ(3 √ n) exponentiations, and verifying a signature requires Θ(n 2/3) pairing operations. To the best of our knowledge, this is the first ring signature based on bilinear groups with o(√ n) signatures and sublinear verification complexity.

show abstract

Section: Related Workmentioning

confidence: 99%

Shorter Ring Signatures from Standard Assumptions

González

2019

Public-Key Cryptography – PKC 2019

View full text Add to dashboard Cite

show abstract

“…This security property ensures that there is no computational way to forge a ring signature with only the knowledge of a list of public keys PK L = (pk i , ..., pk n ) of n members. Its security model is defined as the following game between a PPT A and C [42].…”

Section: Unforgeabilitymentioning

confidence: 99%

A Generic Framework for Accountable Optimistic Fair Exchange Protocol

Loh

Heng²,

Tan³

2019

Symmetry

View full text Add to dashboard Cite

Optimistic Fair Exchange protocol was designed for two parties to exchange in a fair way where an arbitrator always remains offline and will be referred only if any dispute happens. There are various optimistic fair exchange protocols with different security properties in the literature. Most of the optimistic fair exchange protocols satisfy resolution ambiguity where a signature signed by the signer is computational indistinguishable from the one resolved by the arbitrator. Huang et al. proposed the first generic framework for accountable optimistic fair exchange protocol in the random oracle model where it possesses resolution ambiguity and is able to reveal the actual signer when needed. Ganjavi et al. later proposed the first generic framework in the standard model. In this paper, we propose a new generic framework for accountable optimistic fair exchange protocol in the standard model using ordinary signature, convertible undeniable signature, and ring signature scheme as the underlying building blocks. We also provide an instantiation using our proposed generic framework to obtain an efficient pairing-based accountable optimistic fair exchange protocol with short signature.

show abstract

“…The main contribution to the research community of this protocol is that it provides user privacy-preserving distributed access control in a single-owner multi-user sensor network. A ring signature [56] is used to protect the anonymity of users by using a group ID and group signature. Each group of users has different access privileges, IDs and keys for signature.…”

Section: Users' Privacy-preserving Access Control (Uppac)mentioning

confidence: 99%

A Survey of Access Control Models in Wireless Sensor Networks

Maw

Xiao

Christianson

et al. 2014

JSAN

View full text Add to dashboard Cite

copyright 2014 by the authors; licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution license (http://creativecommons.org/licenses/by/3.0/)Wireless sensor networks (WSNs) have attracted considerable interest in the research community, because of their wide range of applications. However, due to the distributed nature of WSNs and their deployment in remote areas, these networks are vulnerable to numerous security threats that can adversely affect their proper functioning. Resource constraints in sensor nodes mean that security mechanisms with a large overhead of computation and communication are impractical to use in WSNs; security in sensor networks is, therefore, a challenge. Access control is a critical security service that offers the appropriate access privileges to legitimate users and prevents illegitimate users from unauthorized access. However, access control has not received much attention in the context of WSNs. This paper provides an overview of security threats and attacks, outlines the security requirements and presents a state-of-the-art survey on access control models, including a comparison and evaluation based on their characteristics in WSNs. Potential challenging issues for access control schemes in WSNs are also discussed

show abstract

Ring Signatures: Stronger Definitions, and Constructions Without Random Oracles

Cited by 231 publications

References 17 publications

Shorter Ring Signatures from Standard Assumptions

Shorter Ring Signatures from Standard Assumptions

A Generic Framework for Accountable Optimistic Fair Exchange Protocol

A Survey of Access Control Models in Wireless Sensor Networks

Contact Info

Product

Resources

About