Pages that link to "Item:Q6104329"
From MaRDI portal
The following pages link to Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general (Q6104329):
Displaying 33 items.
- Lattice-based zero-knowledge arguments for additive and multiplicative relations (Q831178) (← links)
- Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs (Q1648790) (← links)
- Zero-knowledge arguments for lattice-based PRFs and applications to E-cash (Q1701449) (← links)
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption (Q1711842) (← links)
- Shorter lattice-based zero-knowledge proofs via one-time commitments (Q2061919) (← links)
- Lattice-based zero-knowledge proofs: new techniques for shorter and faster constructions and applications (Q2181847) (← links)
- How to Prove Knowledge of Small Secrets (Q2829957) (← links)
- Zero-Knowledge Proofs with Low Amortized Communication from Lattice Assumptions (Q2912785) (← links)
- Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems (Q3408195) (← links)
- Improved Zero-Knowledge Identification with Lattices (Q4933208) (← links)
- Efficient Post-quantum SNARKs for RSIS and RLWE and Their Applications to Privacy (Q5041224) (← links)
- Efficient Verifiable Partially-Decryptable Commitments from Lattices and Applications (Q5087262) (← links)
- Efficient lattice-based traceable ring signature scheme with its application in blockchain (Q6052654) (← links)
- Functional commitments for all functions, with transparent setup and from SIS (Q6063522) (← links)
- A new framework for more efficient round-optimal lattice-based (partially) blind signature via trapdoor sampling (Q6104338) (← links)
- Relaxed Lattice-Based Signatures with Short Zero-Knowledge Proofs (Q6108830) (← links)
- On rejection sampling in Lyubashevsky's signature scheme (Q6133962) (← links)
- BLOOM: bimodal lattice one-out-of-many proofs and applications (Q6133965) (← links)
- Vector commitments over rings and compressed \(\varSigma \)-protocols (Q6169352) (← links)
- Bicameral and auditably private signatures (Q6562571) (← links)
- A generic construction of an anonymous reputation system and instantiations from lattices (Q6562575) (← links)
- Lattice-based polynomial commitments: towards asymptotic and concrete efficiency (Q6595849) (← links)
- Efficient updatable public-key encryption from lattices (Q6604934) (← links)
- Ring/module learning with errors under linear leakage -- hardness and applications (Q6635772) (← links)
- Lattice-based threshold, accountable, and private signature (Q6636114) (← links)
- Crypto dark matter on the torus. Oblivious PRFs from shallow PRFs and TFHE (Q6637580) (← links)
- SLAP: succinct lattice-based polynomial commitments from standard assumptions (Q6637716) (← links)
- Aggregating Falcon signatures with LaBRADOR (Q6648189) (← links)
- Polytopes in the Fiat-Shamir with aborts paradigm (Q6648197) (← links)
- A systematic study of sparse LWE (Q6652897) (← links)
- Lattice-based zero-knowledge proofs in action: applications to electronic voting (Q6655871) (← links)
- Polynomial commitments from lattices: post-quantum security, fast verification and transparent setup (Q6660298) (← links)
- Greyhound: fast polynomial commitments from lattices (Q6660299) (← links)
