| Forward-Secure Encryption with Fast Forwarding
|
2022 |
Dodis, Yevgeniy |
| Sublinear Secure Computation from New Assumptions
|
2022 |
Boyle, Elette |
| A Tight Computational Indistinguishability Bound for Product Distributions
|
2022 |
Geier, Nathan |
| Secure Non-interactive Simulation from Arbitrary Joint Distributions
|
2022 |
Khorasgani, Hamidreza Amini |
| Fully-Secure MPC with Minimal Trust
|
2022 |
Ishai, Yuval |
| On Perfectly Secure Two-Party Computation for Symmetric Functionalities with Correlated Randomness
|
2022 |
Alon, Bar |
| The Price of Verifiability: Lower Bounds for Verifiable Random Functions
|
2022 |
Brandt, Nicholas |
| Achievable CCA2 Relaxation for Homomorphic Encryption
|
2022 |
Akavia, Adi |
| How to Obfuscate MPC Inputs
|
2022 |
McQuoid, Ian |
| Adaptive Multiparty NIKE
|
2022 |
Koppula, Venkata |
| On the Worst-Case Inefficiency of CGKA
|
2022 |
Bienstock, Alexander |
| Four-Round Black-Box Non-malleable Schemes from One-Way Permutations
|
2022 |
Ciampi, Michele |
| On the Impossibility of Algebraic Vector Commitments in Pairing-Free Groups
|
2022 |
Catalano, Dario |
| Public-Key Encryption from Homogeneous CLWE
|
2022 |
Bogdanov, Andrej |
| Poly Onions: Achieving Anonymity in the Presence of Churn
|
2022 |
Ando, Megumi |
| Rate-1 Incompressible Encryption from Standard Assumptions
|
2022 |
Branco, Pedro |
| Statistical Security in Two-Party Computation Revisited
|
2022 |
Badrinarayanan, Saikrishna |
| Round-Optimal Honest-Majority MPC in Minicrypt and with Everlasting Security
|
2022 |
Applebaum, Benny |
| Secure Sampling with Sublinear Communication
|
2022 |
Choi, Seung Geol |
| SCALES: MPC with Small Clients and Larger Ephemeral Servers
|
2022 |
Acharya, Anasuya |
Tag hinzufügen