The following pages link to Jonathan Bootle (Q1633468):
Displaying 20 items.
- LWE without modular reduction and improved side-channel attacks against BLISS (Q1633471) (← links)
- Arya: nearly linear-time zero-knowledge proofs for correct program execution (Q1633476) (← links)
- Linear-time zero-knowledge proofs for arithmetic circuit satisfiability (Q1701451) (← links)
- Efficient batch zero-knowledge arguments for low degree polynomials (Q1753866) (← links)
- Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits (Q1784111) (← links)
- Efficient zero-knowledge proof systems (Q1796883) (← links)
- A non-PCP approach to succinct quantum-safe zero-knowledge (Q2096535) (← links)
- Linear-time arguments with sublinear verification from tensor codes (Q2119036) (← links)
- Sumcheck arguments and their applications (Q2120101) (← links)
- More efficient amortization of exact zero-knowledge proofs for LWE (Q2148770) (← links)
- Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier (Q2170049) (← links)
- Gemini: elastic SNARKs for diverse environments (Q2170056) (← links)
- Algebraic techniques for short(er) exact lattice-based zero-knowledge proofs (Q2181849) (← links)
- Foundations of fully dynamic group signatures (Q2210441) (← links)
- Cryptanalysis of compact-LWE (Q2287506) (← links)
- Foundations of Fully Dynamic Group Signatures (Q2822669) (← links)
- Compact Privacy Protocols from Post-quantum and Timed Classical Assumptions (Q5041222) (← links)
- Short Accountable Ring Signatures Based on DDH (Q5097048) (← links)
- Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting (Q5739207) (← links)
- Generalized fuzzy password-authenticated key exchange from error correcting codes (Q6562582) (← links)
