| Verifiable Mix-Nets and Distributed Decryption for Voting from Lattice-Based Assumptions. | 0 | 0.34 | 2022 |
| Feta: Efficient Threshold Designated-Verifier Zero-Knowledge Proofs | 0 | 0.34 | 2022 |
| Feta: Efficient Threshold Designated-Verifier Zero-Knowledge Proofs. | 0 | 0.34 | 2022 |
| Mozℤ 2 k arella: Efficient Vector-OLE and Zero-Knowledge Proofs Over ℤ 2 k . | 0 | 0.34 | 2022 |
| Mac'N'Cheese: Zero-Knowledge Proofs For Boolean And Arithmetic Circuits With Nested Disjunctions | 0 | 0.34 | 2021 |
| Fairness in the Eyes of the Data: Certifying Machine-Learning Models | 0 | 0.34 | 2021 |
| Appenzeller to Brie: Efficient Zero-Knowledge Proofs for Mixed-Mode Arithmetic and Z2k | 0 | 0.34 | 2021 |
| Lattice-Based Proof of Shuffle and Applications to Electronic Voting. | 0 | 0.34 | 2021 |
| SoK: Mitigation of Front-running in Decentralized Finance. | 0 | 0.34 | 2021 |
| A Framework for Universally Composable Publicly Verifiable Cryptographic Protocols. | 0 | 0.34 | 2020 |
| Efficient Constant-Round MPC with Identifiable Abort and Public Verifiability. | 0 | 0.34 | 2020 |
| Insured MPC - Efficient Secure Computation with Financial Penalties. | 0 | 0.34 | 2020 |
| PESTO: Proactively Secure Distributed Single Sign-On, or How to Trust a Hacked Server. | 0 | 0.34 | 2019 |
| Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography. | 0 | 0.34 | 2019 |
| Insured MPC: Efficient Secure Multiparty Computation with Punishable Abort. | 0 | 0.34 | 2018 |
| Sub-Linear Lattice-Based Zero-Knowledge Arguments for Arithmetic Circuits. | 2 | 0.36 | 2018 |
| Towards Practical Lattice-Based One-Time Linkable Ring Signatures. | 2 | 0.37 | 2018 |
| More Efficient Commitments from Structured Lattice Assumptions. | 1 | 0.36 | 2018 |
| Simple Amortized Proofs of Shortness for Linear Relations over Polynomial Rings. | 2 | 0.37 | 2017 |
| On Garbling Schemes With And Without Privacy. | 1 | 0.35 | 2016 |
| Efficient Commitments and Zero-Knowledge Protocols from Ring-SIS with Applications to Lattice-based Threshold Cryptosystems. | 11 | 0.56 | 2016 |
| Better Preprocessing for Secure Multiparty Computation. | 1 | 0.35 | 2016 |
| How to prove knowledge of small secrets. | 9 | 0.54 | 2016 |
| Efficient Secure Multiparty Computation with Identifiable Abort. | 2 | 0.37 | 2016 |
| Publicly Auditable Secure Multi-Party Computation. | 21 | 0.97 | 2014 |
