Compact ring signatures from learning with errors

DOI10.1007/978-3-030-84242-0_11zbMath1485.94134OpenAlexW3188757031MaRDI QIDQ2120080

Omkant Pandey, Xiao Liang, Dakshita Khurana, Giulio Malavolta, Sina Shiehian, Sanjam Garg, Rohit Chatterjee, Mohammad Hajiabadi

Publication date: 31 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-84242-0_11

zbMATH Keywords

learning with errors problempost-quantum secure scheme

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62) Quantum cryptography (quantum-theoretic aspects) (81P94)

Related Items (4)

One-shot Fiat-Shamir-based NIZK arguments of composite residuosity and logarithmic-size ring signatures in the standard model ⋮ Efficient unique ring signatures from lattices ⋮ A note on the post-quantum security of (ring) signatures ⋮ Logarithmic-size (linkable) threshold ring signatures in the plain model

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Two-message statistically sender-private OT from LWE
• Efficient ring signatures in the standard model
• Signatures with flexible public key: introducing equivalence classes for public keys
• Forward-secure linkable ring signatures
• Post-quantum one-time linkable ring signature and application to ring confidential transactions in blockchain (lattice ringct v1.0)
• Statistical ZAP arguments
• Statistical Zaps and new oblivious transfer protocols
• SMILE: set membership from ideal lattices with applications to ring signatures and confidential transactions
• Logarithmic-size ring signatures with tight security from the DDH assumption
• Noninteractive zero knowledge for NP from (Plain) Learning With Errors
• Towards practical lattice-based one-time linkable ring signatures
• Ring signatures: logarithmic-size, no setup -- from standard assumptions
• It wasn't me! Repudiability and claimability of ring signatures
• Calamari and Falafl: logarithmic (linkable) ring signatures from isogenies and lattices
• Sub-linear Blind Ring Signatures without Random Oracles
• Maliciously Circuit-Private FHE
• One-Out-of-Many Proofs: Or How to Leak a Secret and Spend a Coin
• Trapdoors for hard lattices and new cryptographic constructions
• A CDH-Based Ring Signature Scheme with Short Signatures and Public Keys
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• 1-out-of-n Signatures from a Variety of Keys
• Pseudorandomness of ring-LWE for any ring and modulus
• Fully homomorphic encryption using ideal lattices
• Public-key cryptosystems from the worst-case shortest vector problem
• Fiat-Shamir: from practice to theory
• Advances in Cryptology - EUROCRYPT 2004
• Ring Signatures of Sub-linear Size Without Random Oracles
• Progress in Cryptology - INDOCRYPT 2003
• Zaps and Their Applications
• Classical hardness of learning with errors
• Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors
• Efficient Ring Signatures Without Random Oracles
• Theory of Cryptography
• On lattices, learning with errors, random linear codes, and cryptography

This page was built for publication: Compact ring signatures from learning with errors