The following pages link to Jens Groth (Q290389):
Displaying 32 items.
- Structure-preserving signatures and commitments to group elements (Q290392) (← links)
- A verifiable secret shuffle of homomorphic encryptions (Q604630) (← links)
- Cryptography in the multi-string model (Q744350) (← links)
- Updatable and universal common reference strings with applications to zk-SNARKs (Q776013) (← links)
- Arya: nearly linear-time zero-knowledge proofs for correct program execution (Q1633476) (← links)
- Snarky signatures: minimal signatures of knowledge from simulation-extractable snarks (Q1680230) (← links)
- Linear-time zero-knowledge proofs for arithmetic circuit satisfiability (Q1701451) (← links)
- Towards a classification of non-interactive computational assumptions in cyclic groups (Q1703915) (← 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)
- Linear-time arguments with sublinear verification from tensor codes (Q2119036) (← links)
- On the security of ECDSA with additive key derivation and presignatures (Q2170006) (← links)
- Foundations of fully dynamic group signatures (Q2210441) (← links)
- Efficient fully structure-preserving signatures and shrinking commitments (Q2318093) (← links)
- Efficient Fully Structure-Preserving Signatures for Large Messages (Q2811133) (← links)
- Foundations of Fully Dynamic Group Signatures (Q2822669) (← links)
- Converting Cryptographic Schemes from Symmetric to Asymmetric Bilinear Groups (Q2874508) (← links)
- Structure-Preserving Signatures from Type II Pairings (Q2874516) (← links)
- Efficient Zero-Knowledge Argument for Correctness of a Shuffle (Q2894413) (← links)
- Square Span Programs with Applications to Succinct NIZK Arguments (Q2938864) (← links)
- Making Sigma-Protocols Non-interactive Without Random Oracles (Q2941214) (← links)
- One-Out-of-Many Proofs: Or How to Leak a Secret and Spend a Coin (Q2948385) (← links)
- Efficient Zero-Knowledge Proofs (Q3011928) (← links)
- Short Pairing-Based Non-interactive Zero-Knowledge Arguments (Q3058664) (← links)
- Short Non-interactive Zero-Knowledge Proofs (Q3058665) (← links)
- Pairing-Based Non-interactive Zero-Knowledge Proofs (Q3059651) (← links)
- Optimal Structure-Preserving Signatures (Q3092343) (← links)
- Efficient Zero-Knowledge Arguments from Two-Tiered Homomorphic Commitments (Q3102201) (← links)
- Separating Short Structure-Preserving Signatures from Non-interactive Assumptions (Q3102213) (← links)
- Linear Algebra with Sub-linear Zero-Knowledge Arguments (Q3183565) (← links)
- Applied Cryptography and Network Security (Q4680970) (← links)
