The following pages link to Helger Lipmaa (Q826261):
Displaying 50 items.
- More efficient shuffle argument from unique factorization (Q826262) (← links)
- Prover-efficient commit-and-prove zero-knowledge snarks (Q1626134) (← links)
- A subversion-resistant SNARK (Q1701432) (← links)
- An efficient pairing-based shuffle argument (Q1703916) (← links)
- On the security properties of e-voting bulletin boards (Q1796816) (← links)
- On subversion-resistant SNARKs (Q2039405) (← links)
- Key-and-argument-updatable QA-NIZKs (Q2106673) (← links)
- Somewhere statistically binding commitment schemes with applications (Q2145407) (← links)
- UC-secure CRS generation for SNARKs (Q2177622) (← links)
- DL-extractable UC-commitment schemes (Q2291399) (← links)
- Succinct functional commitment for a large class of arithmetic circuits (Q2691602) (← links)
- Secure and efficient time-stamping systems (Q2774539) (← links)
- Communication Optimal Tardos-Based Asymmetric Fingerprinting (Q2790060) (← links)
- Efficient Culpably Sound NIZK Shuffle Argument Without Random Oracles (Q2799014) (← links)
- Prover-Efficient Commit-and-Prove Zero-Knowledge SNARKs (Q2814707) (← links)
- Succinct Non-Interactive Zero Knowledge Arguments from Span Programs and Linear Error-Correcting Codes (Q2867210) (← links)
- Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments (Q2891482) (← links)
- A More Efficient Computationally Sound Non-Interactive Zero-Knowledge Shuffle Argument (Q2912814) (← links)
- Efficient NIZK Arguments via Parallel Verification of Benes Networks (Q2922673) (← links)
- A Shuffle Argument Secure in the Generic Model (Q2953798) (← links)
- Secure Vickrey Auctions without Threshold Trust (Q2995364) (← links)
- On the CCA1-Security of Elgamal and Damgård’s Elgamal (Q3019913) (← links)
- (Q3046620) (← links)
- Efficient Generalized Selective Private Function Evaluation with Applications in Biometric Authentication (Q3056892) (← links)
- Linear Batch Codes (Q3460471) (← links)
- Succinct NP Proofs from an Extractability Assumption (Q3507432) (← links)
- New Communication-Efficient Oblivious Transfer Protocols Based on Pairings (Q3540161) (← links)
- On the Feasibility of Consistent Computations (Q3562890) (← links)
- Multi-query Computationally-Private Information Retrieval with Constant Communication Rate (Q3562891) (← links)
- 3-Message NP Arguments in the BPK Model with Optimal Soundness and Zero-Knowledge (Q3596756) (← links)
- A New Protocol for Conditional Disclosure of Secrets and Its Applications (Q3612383) (← links)
- (Q4249353) (← links)
- (Q4250821) (← links)
- (Q4408415) (← links)
- (Q4408456) (← links)
- (Q4417391) (← links)
- Financial Cryptography (Q4680922) (← links)
- (Q4950052) (← links)
- On QA-NIZK in the BPK Model (Q5041171) (← links)
- A Unified Framework for Non-universal SNARKs (Q5087272) (← links)
- Secure Equality and Greater-Than Tests with Sublinear Online Complexity (Q5327472) (← links)
- (Q5387701) (← links)
- Information and Communications Security (Q5393990) (← links)
- Information and Communications Security (Q5393994) (← links)
- Information Security (Q5493180) (← links)
- Hybrid Damgård Is CCA1-Secure under the DDH Assumption (Q5502748) (← links)
- Financial Cryptography and Data Security (Q5712256) (← links)
- Fast Software Encryption (Q5713915) (← links)
- Automata, Languages and Programming (Q5716797) (← links)
- CCA-Secure Inner-Product Functional Encryption from Projective Hash Functions (Q5738751) (← links)
