[PDF] How to Leak a Secret: Theory and Applications of Ring Signatures | Semantic Scholar (2024)

This paper revisits the construction of ring signatures and proposes a scheme that is secure in the strongest sense and extends the construction to a two-party blind ring signature, which is safe in the standard model under well-known number-theoretic assumptions.

This thesis designs a protocol that enables a ring signer to receive an acknowledgement from the verifier and introduces the concept of identity-based anonymous designated ring signatures, which has not been studied before.

This work formalizes the concept of universal ring signatures (URS), and presents several constructions of URS, offering different tradeoffs between assumptions required, the level of security achieved, and the size of signatures.

This work proposes a general framework of TRS, using a non-interactive zero-knowledge proof of knowledge, a hash family, and a pseudorandom function with some additional properties, and gives two concrete efficient TRS schemes from lattices and symmetric-key primitives respectively, which are proven to be secure in the quantum random oracle model.

This paper points out that a ring signature scheme proposed by Abe, Ohkubo and Suzuki in ASIACRYPT’2002, is not signer anonymous, and proposes a different approach to fix the problem and shows that it does not degrade the performance of the original scheme and is easier to implement than their full-paper version.

This paper combines the Groth-Kohlweiss \(\varSigma \)-protocol (Eurocrypt’15) with dual-mode encryption schemes and proposes a fully tight construction based on the Decision Diffie-Hellman assumption in the random oracle model, with full tightness.

This work proposes a new efficient non-interactive deniable ring signature scheme in the standard model that is a kind of ring signature and therefore, it does not require a setup algorithm, and the ring in the scheme is flexible.

This paper proposes the notion of deniable group signature, where the authority can issue a proof showing that the specified user is NOT the signer of the signature, without revealing the actual signer.

This paper proposes new definitions of anonymity and unforgeability which address these threats, and shows the first constructions of ring signature schemes in the standard model that satisfies the strongest definitions of security.

In threshold discernible ring signatures, a group B of t members can co-operate to identify the original signer of a ring signature that involved a group A of n alleged signers, where B ⊂ A and n > t.

...

...

A novel type of cryptographic scheme, which enables any pair of users to communicate securely and to verify each other’s signatures without exchanging private or public keys, without keeping key directories, and without using the services of a third party.

The resulting scheme is anonymous and existentially unforgeable under chosen message attacks, assuming that the Discrete Logarithm problem is hard to solve.

A generic construction that can convert any existing ring signature schemes to deniable ring authentication schemes and combines any ring signature scheme with an ID-based chameleon hash function is presented.

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.

The generalized forking lemmas are used to prove that the proposed new ring signature scheme is existentially unforgeable under adaptive chosen-message attacks, in the random oracle model.

This paper proposes a novel construction of ID-based ring signature which only needs two pairing computations for any group size, and is proven to be existential unforgeable against adaptive chosen message-and-identity attack under the random oracle model.

This work examplify the verifier designation method for the confirmation protocol for undeniable signatures, and demonstrates how a trap-door commitment scheme can be used to construct designated verifier proofs, both interactive and non-interactive.

In this paper, it is possible to convince a verifier that a member of an ad hoc collection of participants is authenticating a message m without revealing which one and the verifier V cannot convince any third party that the message m was indeed authenticated in a non-interactive way.

An important advantage of ring signatures over group signatures is that there is no need to pre-specify rings or groups of users.

...

...