One-shot Fiat-Shamir-based NIZK arguments of composite residuosity and logarithmic-size ring signatures in the standard model

DOI10.1007/978-3-031-07085-3_17zbMath1496.94057OpenAlexW4285178307MaRDI QIDQ2170058

Publication date: 30 August 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-07085-3_17

compactness standard model Fiat-Shamir simulation-soundness ring signatures composite residuosity NIZK arguments

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)

Related Items (1)

Simple, fast, efficient, and tightly-secure non-malleable non-interactive timed commitments

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Ring signatures: Stronger definitions, and constructions without random oracles
Fiat-Shamir and correlation intractability from strong KDM-secure encryption
From obfuscation to the security of Fiat-Shamir for proofs
Efficient ring signatures in the standard model
Non-interactive zero-knowledge in pairing-free groups from weaker assumptions
NIZK from LPN and trapdoor hash via correlation intractability for approximable relations
Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages
On adaptive security of delayed-input sigma protocols and Fiat-Shamir NIZKs
Compact ring signatures from learning with errors
Logarithmic-size ring signatures with tight security from the DDH assumption
Noninteractive zero knowledge for NP from (Plain) Learning With Errors
Lattice-based zero-knowledge proofs: new techniques for shorter and faster constructions and applications
Shorter ring signatures from standard assumptions
Ring signatures: logarithmic-size, no setup -- from standard assumptions
It wasn't me! Repudiability and claimability of ring signatures
Fully leakage-resilient signatures
Non-interactive composition of sigma-protocols via Share-then-Hash
Simulation-sound arguments for LWE and applications to KDM-CCA2 security
Making Sigma-Protocols Non-interactive Without Random Oracles
One-Out-of-Many Proofs: Or How to Leak a Secret and Spend a Coin
Identity-Based Encryption Secure against Selective Opening Attack
The random oracle methodology, revisited
One-Time Signatures and Chameleon Hash Functions
Lossy Encryption: Constructions from General Assumptions and Efficient Selective Opening Chosen Ciphertext Security
Public-Key Encryption with Simulation-Based Selective-Opening Security and Compact Ciphertexts
Trapdoors for hard lattices and new cryptographic constructions
Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
How To Prove Yourself: Practical Solutions to Identification and Signature Problems
The Knowledge Complexity of Interactive Proof Systems
A New Algorithm for Factoring Polynomials Over Finite Fields
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
1-out-of-n Signatures from a Variety of Keys
Fiat-Shamir: from practice to theory
Finding a Nash equilibrium is no easier than breaking Fiat-Shamir
Verifiable Random Functions from Weaker Assumptions
Advances in Cryptology - EUROCRYPT 2004
Advances in Cryptology – CRYPTO 2004
Advances in Cryptology - CRYPTO 2003
Ring Signatures of Sub-linear Size Without Random Oracles
Mesh Signatures
Progress in Cryptology – Mycrypt 2005
Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors
Efficient Ring Signatures Without Random Oracles
On Signatures of Knowledge
Optimally Sound Sigma Protocols Under DCRA
Theory of Cryptography
Theory of Cryptography
On lattices, learning with errors, random linear codes, and cryptography
SNARGs for bounded depth computations and PPAD hardness from sub-exponential LWE
Fiat–Shamir via list-recoverable codes (or: parallel repetition of GMW is not zero-knowledge)

This page was built for publication: One-shot Fiat-Shamir-based NIZK arguments of composite residuosity and logarithmic-size ring signatures in the standard model