Pages that link to "Item:Q1784111"

The following pages link to Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits (Q1784111):

Displaying 37 items.

• Lattice-based zero-knowledge arguments for additive and multiplicative relations (Q831178) (← links)
• Linear-time zero-knowledge proofs for arithmetic circuit satisfiability (Q1701451) (← links)
• Lattice-based zero-knowledge arguments for integer relations (Q1784112) (← links)
• Sigma protocols for MQ, PKP and SIS, and fishy signature schemes (Q2055652) (← links)
• Boosting verifiable computation on encrypted data (Q2055689) (← links)
• A non-PCP approach to succinct quantum-safe zero-knowledge (Q2096535) (← links)
• Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics (Q2102078) (← links)
• Zero-knowledge proofs for committed symmetric Boolean functions (Q2118554) (← links)
• \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments (Q2120097) (← links)
• Subquadratic SNARGs in the random oracle model (Q2120100) (← links)
• Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices (Q2128574) (← links)
• A compressed \(\varSigma \)-protocol theory for lattices (Q2128575) (← links)
• A new simple technique to bootstrap various lattice zero-knowledge proofs to QROM secure NIZKs (Q2128576) (← links)
• SMILE: set membership from ideal lattices with applications to ring signatures and confidential transactions (Q2128577) (← links)
• More efficient amortization of exact zero-knowledge proofs for LWE (Q2148770) (← links)
• Asymptotically quasi-optimal cryptography (Q2170004) (← links)
• Succinct arguments in the quantum random oracle model (Q2175929) (← links)
• Efficient, actively secure MPC with a dishonest majority: a survey (Q2232208) (← links)
• Shorter lattice-based zero-knowledge proofs for the correctness of a shuffle (Q2670855) (← links)
• Laconic private set intersection and applications (Q2697887) (← links)
• Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography (Q5041168) (← 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 Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting (Q5739207) (← links)
• Functional commitments for all functions, with transparent setup and from SIS (Q6063522) (← links)
• Practical sublinear proofs for R1CS from lattices (Q6104331) (← links)
• Efficient zero-knowledge arguments in discrete logarithm setting: sublogarithmic proof or sublinear verifier (Q6132419) (← links)
• Lower bound on SNARGs in the random oracle model (Q6163944) (← links)
• Orion: zero knowledge proof with linear prover time (Q6166953) (← links)
• On black-box constructions of time and space efficient sublinear arguments from symmetric-key primitives (Q6169365) (← links)
• Lattice-based polynomial commitments: towards asymptotic and concrete efficiency (Q6595849) (← links)
• SLAP: succinct lattice-based polynomial commitments from standard assumptions (Q6637716) (← 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)
• Field-agnostic SNARKs from expand-accumulate codes (Q6660301) (← links)
• Concretely efficient lattice-based polynomial commitment from standard assumptions (Q6660308) (← links)
• Attribute-based keyed fully homomorphic encryption (Q6660543) (← links)