Related Experiment Video
Updated: Aug 27, 2025

Trapping of Micro Particles in Nanoplasmonic Optical Lattice
Published on: September 5, 2017
Efficient Lattice-Based Ring Signature Scheme without Trapdoors for Machine Learning
Qing Ye1, Yongkang Lang1, Zongqu Zhao1
1School of Software, Henan Polytechnic University, Jiaozuo 454000, China.
This study introduces a novel lattice-based ring signature (RS) scheme without trapdoors, enhancing privacy protection for machine learning (ML). The new scheme offers superior computational efficiency and stronger security guarantees, making it ideal for ML applications.
Area of Science:
- Cryptography
- Lattice-based cryptography
- Machine Learning Security
Background:
- Machine learning (ML) and privacy protection are deeply intertwined, with ML systems being both targets and tools for privacy.
- Ring signatures (RS) offer cryptographic privacy, and lattice-based RS provides quantum resistance.
- Existing lattice-based RS schemes often rely on trapdoors, hindering computational efficiency due to hidden algebraic structures.
Purpose of the Study:
- To construct a novel, efficient, and secure lattice-based ring signature (RS) scheme for machine learning (ML) scenarios.
- To develop an RS scheme that avoids the computational overhead associated with trapdoor constructions.
- To enhance privacy protection in ML by leveraging advanced cryptographic techniques.
Main Methods:
- Utilized the Lyubashevsky collision-resistant hash function over lattices.
- Constructed a ring signature scheme based on ideal lattices.
- Employed the Fiat‒Shamir with aborts (FSwA) protocol for the construction.
- Analyzed security in terms of unconditional anonymity against chosen setting attacks (UA-CSA) and unforgeability with respect to insider corruption (EU-IC).
Main Results:
- Proposed a new lattice-based RS scheme without trapdoors.
- Achieved unconditional anonymity against chosen setting attacks (UA-CSA), a stronger security level than anonymity against full key exposure (anonymity-FKE).
- Satisfied unforgeability with respect to insider corruption (EU-IC).
- Demonstrated superior computational efficiency in signing and verification compared to existing schemes with similar security levels.
Conclusions:
- The developed lattice-based RS scheme offers enhanced privacy and security for ML applications.
- The absence of trapdoors and the use of ideal lattices lead to significant improvements in computational efficiency.
- This scheme is well-suited for ML environments requiring robust privacy protection and high performance.
Related Concept Videos
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...
Routh-Hurwitz Criterion I
To apply the Routh-Hurwitz criterion, a Routh table is constructed. The table's rows are labeled with powers of the complex frequency variable s, starting from the...
Lattice Centering and Coordination Number
Types of Unit Cells
Imagine taking a large number of identical...
Wald-Wolfowitz Runs Test II
For binary data, runs are identified using symbols such as + and −, or equivalently, 1s and...
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Bewley Lattice Diagram

