Probing Security through Input-Output Separation and Revisited Quasilinear Masking. | 0 | 0.34 | 2021 |
Dynamic Random Probing Expansion with Quasi Linear Asymptotic Complexity. | 0 | 0.34 | 2021 |
Succinct Diophantine-Satisfiability Arguments. | 0 | 0.34 | 2020 |
Public-Key Generation with Verifiable Randomness. | 0 | 0.34 | 2020 |
Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND. | 0 | 0.34 | 2019 |