Related Experiment Video
Updated: Oct 22, 2025

Stable DNA Motifs, 1D and 2D Nanostructures Constructed from Small Circular DNA Molecules
Published on: April 12, 2019
Lattice-Based Logarithmic-Size Non-Interactive Deniable Ring Signatures
Huiwen Jia1, Chunming Tang1, Yanhua Zhang2
1School of Mathematics and Information Science, Guangzhou University, No. 230 Wai Huan Xi Road, Guangzhou 510006, China.
Abstract:
Deniable ring signature can be regarded as group signature without group manager, in which a singer is capable of singing a message anonymously, but, if necessary, each ring member is allowed to confirm or disavowal its involvement in the signature via an interactive mechanism between the ring member and the verifier. This attractive feature makes the deniable ring signature find many applications in the real world. In this work, we propose an efficient scheme with signature size logarithmic to the cardinality of the ring. From a high level, we adapt Libert et al.'s zero-knowledge argument system (Eurocrypt 2016) to allow the prover to convince the verifier that its witness satisfies an additional condition. Then, using the Fait-Shamir transformation, we get a non-interactive deniable ring signature scheme that satisfies the anonymity, traceability, and non-frameability under the small integer solution assumption in the random oracle model.
Related Concept Videos
Bewley Lattice Diagram
Lattice Centering and Coordination Number
Types of Unit Cells
Imagine taking a large number of identical...
Social Loafing
Base-Catalyzed Ring-Opening of Epoxides
Trends in Lattice Energy: Ion Size and Charge
Routh-Hurwitz Criterion II
The first scenario occurs when a singular zero appears in the first column of the Routh table. This situation creates a division by zero issues. To resolve this, a small positive or negative number, denoted as epsilon (∈), is substituted for the zero. The stability analysis proceeds by assuming a sign for ∈. If ∈ is positive, any sign change in the first...

