Ring Signatures of Sub-linear Size Without Random Oracles

@inproceedings{Chandran2007RingSO,
  title={Ring Signatures of Sub-linear Size Without Random Oracles},
  author={Nishanth Chandran and Jens Groth and A. Sahai},
  booktitle={ICALP},
  year={2007}
}
Ring signatures, introduced by Rivest, Shamir and Tauman, enable a user to sign a message anonymously on behalf of a "ring". A ring is a group of users, which includes the signer. We propose a ring signature scheme that has size O(√N) where N is the number of users in the ring. An additional feature of our scheme is that it has perfect anonymity. Our ring signature like most other schemes uses the common reference string model. We offer a variation of our scheme, where the signer is… Expand
Constant Size Ring Signature Without Random Oracle
TLDR
Construction of a constant size ring signature scheme without random oracle meeting stringent security requirement still remained as an interesting open problem. Expand
Efficient Ring Signatures in the Standard Model
A ring signature scheme allows one party to sign messages on behalf of an arbitrary set of users, called the ring. The anonymity of the scheme guarantees that the signature does not reveal whichExpand
Logarithmic size ring signatures without random oracles
TLDR
This study proposes the first ring signature scheme whose size is O(log2 N), where N is the number of users in the ring and the security of the scheme is proven without requiring random oracles. Expand
Sub-Linear Size Traceable Ring Signatures without Random Oracles
Traceable ring signatures, proposed at PKC'07, are a variant of ring signatures, which allow a signer to anonymously sign a message with a tag behind a ring, i.e., a group of users chosen by theExpand
Ring Signature With Unconditional Anonymity in the Plain Model
TLDR
This paper proposes the first generic construction of ring signature with unconditional anonymity in the plain model based on the standard assumption, which means that it does not need any setup procedure by trusted third party and not depends on a random oracle methodology. Expand
Sub-linear Size Traceable Ring Signatures without Random Oracles
TLDR
This paper proposes the first secure traceable ring signature schemes without random oracles in the common reference string model and has a signature size of O(√N), where N is the number of users in the ring. Expand
Efficient and Random Oracle-Free Conditionally Anonymous Ring Signature
TLDR
This paper proposes a practical ring signature scheme with traceability without random oracles in the common reference string model and relies on NIZKs and pseudorandom functions, which render it to be inefficient. Expand
Compact Ring Signatures from Learning With Errors
TLDR
This work presents the first compact ring signature scheme from the (plain) learning with errors (LWE) problem, and a new construction of compact and statistically witness indistinguishable ZAP arguments for NP ∩ coNP, that is shown to be sound based on the plain LWE assumption. Expand
A Ring Signature of size Θ ( 3 √ n ) without Random Oracles
Ring signatures, introduced by Rivest, Shamir and Tauman (ASIACRYPT 2001), allow to sign a message on behalf of a set of users (called a ring) while guaranteeing authenticity, i.e. only members ofExpand
Ring Signatures: Logarithmic-Size, No Setup - from Standard Assumptions
TLDR
A natural goal is to construct a ring signature scheme for which the signature size is short in the number of ring members, but such a construction should not rely on a trusted setup and be proven secure under falsifiable standard assumptions. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 22 REFERENCES
Efficient Ring Signatures Without Random Oracles
TLDR
This work describes the first efficient ring signature scheme secure, without random oracles, based on standard assumptions, and proves its scheme to be anonymous against full key exposure and unforgeable with respect to insider corruption. Expand
Ring signatures without random oracles
TLDR
A ring signature scheme based on bilinear pairings is proven to be secure against adaptive chosen message attack without using the random oracle model, one of the first in the literature to achieve this security level. Expand
Ring Signatures: Stronger Definitions, and Constructions without Random Oracles
TLDR
This paper proposes new definitions of anonymity and unforgeability which address these threats, and shows two constructions of ring signature schemes in the standard model: one based on generic assumptions which satisfies the strongest definitions of security, and a second, more efficient scheme achieving weaker security guarantees and more limited functionality. Expand
Compact Group Signatures Without Random Oracles
TLDR
The size of signatures in this scheme is logarithmic in the number of signers; the scheme is secure under the Computational Diffie-Hellman and the Subgroup Decision assumptions in the model of Bellare, Micciancio, and Warinshi, as relaxed by Boneh, Boyen, and Shacham. Expand
Short Signatures Without Random Oracles
TLDR
A short signature scheme which is existentially unforgeable under a chosen message attack without using random oracles, which depends on a new complexity assumption the authors call the Strong Diffie-Hellman assumption. Expand
How to Leak a Secret: Theory and Applications of Ring Signatures
TLDR
This work formalizes the notion of a ring signature, which makes it possible to specify a set of possible signers without revealing which member actually produced the signature, and presents the presentation of efficient constructions of ring signatures. Expand
Mesh Signatures
TLDR
These signatures have linear size, achieve everlasting perfect anonymity, and reduce to very efficient ring signatures without random oracles as a special case, and are proved non-repudiation from a mild extension of the SDH assumption. Expand
Deniable Ring Authentication
  • M. Naor
  • Mathematics, Computer Science
  • CRYPTO
  • 2002
TLDR
This paper provides an efficient protocol for deniable ring authentication based on any strong encryption scheme, that is once an entity has published a public-key of such an encryption system, it can be drafted to any such ring, with no need for any other cryptographic primitive. Expand
Anonymous Identification in Ad Hoc Groups
TLDR
This work provides a formal model for Ad hoc Anonymous Identification schemes and design secure such schemes both generically (based on any accumulator with one-way domain) and for a specific efficient implementation of such an accumulator based on the Strong RSA Assumption. Expand
Identity-Based Encryption from the Weil Pairing
TLDR
This work proposes a fully functional identity-based encryption scheme (IBE) based on the Weil pairing that has chosen ciphertext security in the random oracle model assuming an elliptic curve variant of the computational Diffie-Hellman problem. Expand
...
1
2
3
...