| On Communication-Efficient Asynchronous MPC with Adaptive Security
|
2021 |
Chopard, Annick |
| Multi-Party Functional Encryption
|
2021 |
Agrawal, Shweta |
| Succinct LWE Sampling, Random Polynomials, and Obfuscation
|
2021 |
Devadas, Lalita |
| Continuously Non-malleable Secret Sharing: Joint Tampering, Plain Model and Capacity
|
2021 |
Brian, Gianluca |
| Multi-party PSM, Revisited: Improved Communication and Unbalanced Communication
|
2021 |
Assouline, Leonard |
| On Treewidth, Separators and Yao’s Garbling
|
2021 |
Kamath, Chethan |
| Direct Product Hardness Amplification
|
2021 |
Lanzenberger, David |
| BKW Meets Fourier New Algorithms for LPN with Sparse Parities
|
2021 |
Dachman-Soled, Dana |
| Computational Robust (Fuzzy) Extractors for CRS-Dependent Sources with Minimal Min-entropy
|
2021 |
Feng, Hanwen |
| Efficient Perfectly Secure Computation with Optimal Resilience
|
2021 |
Abraham, Ittai |
| On Communication Models and Best-Achievable Security in Two-Round MPC
|
2021 |
Goel, Aarushi |
| ABE for DFA from LWE Against Boundea Collusions, Revisited
|
2021 |
Wee, Hoeteck |
| Disappearing Cryptography in the Bounded Storage Model
|
2021 |
Guan, Jiaxin |
| On Derandomizing Yao’s Weak-to-Strong OWF Construction
|
2021 |
Brzuska, Chris |
| Dory: Efficient, Transparent Arguments for Generalised Inner Products and Polynomial Commitments
|
2021 |
Lee, Jonathan |
| Generalized Pseudorandom Secret Sharing and Efficient Straggler-Resilient Secure Computation
|
2021 |
Benhamouda, Fabrice |
| Blockchains Enable Non-interactive MPC
|
2021 |
Goyal, Vipul |
| Distributed Merkle’s Puzzles
|
2021 |
Dinur, Itat |
| Trojan-Resilience Without Cryptography
|
2021 |
Chakraborty, Suvradip |
| Simple Constructions from (Almost) Regular One-Way Functions
|
2021 |
Mazor, Noam |
Tag hinzufügen