| Garbled Circuits with Sublinear Evaluator
|
2022 |
Haque, Abida |
| Lightweight, Maliciously Secure Verifiable Function Secret Sharing
|
2022 |
Castro, Leo de |
| On the Security of ECDSA with Additive Key Derivation and Presignatures
|
2022 |
Groth, Jens |
| Secure Multiparty Computation wıth Sublinear Preprocessing
|
2022 |
Boyle, Elette |
| Practical Non-interactive Publicly Verifiable Secret Sharing with Thousands of Parties
|
2022 |
Gentry, Craig |
| Sine Series Approximation of the Mod Function for Bootstrapping of Approximate HE
|
2022 |
Jutla, Charanjit S. |
| Indistinguishability Obfuscation from LPN over Fp, DLIN, and PRGs in NC0
|
2022 |
Jain, Aayush |
| COA-Secure Obfuscation and Applications
|
2022 |
Canetti, Ran |
| Unclonable Polymers and Their Cryptographic Applications
|
2022 |
Almashaqbeh, Ghada |
| EPIGRAM: Practical Garbled RAM
|
2022 |
Heath, David |
| Round-Optimal Byzantine Agreement
|
2022 |
Ghinea, Diana |
| A Complete Characterization of Game-Theoretically Fair, Multi-Party Coin Toss
|
2022 |
Wu, Ke |
| Universally Composable Subversion-Resilient Cryptography
|
2022 |
Chakraborty, Suvradip |
| Round-Optimal Multi-party Computation with Identifiable Abort
|
2022 |
Ciampi, Michele |
| Secure Multiparty Computation with Free Branching
|
2022 |
Goel, Aarushi |
| High-Precision Bootstrapping for Approximate Homomorphic Encryption by Error Variance Minimization
|
2022 |
Lee, Yongwoo |
| Distributed (Correlation) Samplers: How to Remove a Trusted Dealer in One Round
|
2022 |
Abram, Damiano |
| Round-Optimal and Communication-Efficient Multiparty Computation
|
2022 |
Ciampi, Michele |
| Guaranteed Output in O(√n) Rounds for Round-Robin Sampling Protocols
|
2022 |
Cohen, Ran |
| Highly Efficient OT-Based Multiplication Protocols
|
2022 |
Haitner, Iftach |
Tag hinzufügen