| YOSO: You Only Speak Once: Secure MPC with Stateless Ephemeral Roles
|
2021 |
Gentry, Craig |
| Broadcast-Optimal Two Round MPC with an Honest Majority
|
2021 |
Damgård, Ivan |
| SMILE: Set Membership from Ideal Lattices with Applications to Ring Signatures and Confidential Transactions
|
2021 |
Lyubashevsky, Vadim |
| Counterexamples to New Circular Security Assumptions Underlying iO
|
2021 |
Hopkins, Sam |
| Lower Bounds on Lattice Sieving and Information Set Decoding
|
2021 |
Kirshanova, Elena |
| Game-Theoretic Fairness Meets Multi-party Protocols: The Case of Leader Election
|
2021 |
Chung, Kai-Min |
| Computational Hardness of Optimal Fair Computation: Beyond Minicrypt
|
2021 |
Maji, Hemanta K. |
| Secure Computation from One-Way Noisy Communication, or: Anti-correlation via Anti-concentration
|
2021 |
Agrawal, Shweta |
| Three-Round Secure Multiparty Computation from Black-Box Two-Round Oblivious Transfer
|
2021 |
Patra, Arpita |
| Efficient Information-Theoretic Multi-party Computation over Non-commutative Rings
|
2021 |
Escudero, Daniel |
| Pushing the Limits of Valiant’s Universal Circuits: Simpler, Tighter and More Compact
|
2021 |
Liu, Hanlin |
| A Compressed Σ-Protocol Theory for Lattices
|
2021 |
Attema, Thomas |
| How to Meet Ternary LWE Keys
|
2021 |
May, Alexander |
| Towards Faster Polynomial-Time Lattice Reduction
|
2021 |
Kirchner, Paul |
| Fluid MPC: Secure Multiparty Computation with Dynamic Participants
|
2021 |
Choudhuri, Arka Rai |
| Unconditional Communication-Efficient MPC via Hall’s Marriage Theorem
|
2021 |
Goyal, Vipul |
| Non-interactive Secure Multiparty Computation for Symmetric Functions, Revisited: More Efficient Constructions and Extensions
|
2021 |
Eriguchi, Reo |
| MHz2k: MPC from HE over Z2k with New Packing, Simpler Reshare, and Better ZKP
|
2021 |
Cheon, Jung Hee |
| Oblivious Key-Value Stores and Amplification for Private Set Intersection
|
2021 |
Garimella, Gayathri |
| Limits on the Adaptive Security of Yao’s Garbling
|
2021 |
Kamath, Chethan |
Tag hinzufügen