| Efficient Range-Trapdoor Functions and Applications: Rate-1 OT and More
|
2020 |
Garg, Sanjam |
| Expected Constant Round Byzantine Broadcast Under Dishonest Majority
|
2020 |
Wan, Jun |
| Perfect Zero Knowledge: New Upperbounds and Relativized Separations
|
2020 |
Dixon, Peter |
| Optimal Broadcast Encryption from LWE and Pairings in the Standard Model
|
2020 |
Agrawal, Shweta |
| Can a Public Blockchain Keep a Secret?
|
2020 |
Benhamouda, Fabrice |
| On Perfect Correctness in (Lockable) Obfuscation
|
2020 |
Goyal, Rishab |
| Ledger Combiners for Fast Settlement
|
2020 |
Fitzi, Matthias |
| Asynchronous Byzantine Agreement with Subquadratic Communication
|
2020 |
Blum, Erica |
| Round-Efficient Byzantine Broadcast Under Strongly Adaptive and Majority Corruptions
|
2020 |
Wan, Jun |
| Lossiness and Entropic Hardness for Ring-LWE
|
2020 |
Brakerski, Zvika |
| Constant Ciphertext-Rate Non-committing Encryption from Standard Assumptions
|
2020 |
Brakerski, Zvika |
| Equipping Public-Key Cryptographic Primitives with Watermarking (or: A Hole Is to Watermark)
|
2020 |
Nishimaki, Ryo |
| CP-ABE for Circuits (and More) in the Symmetric Key Setting
|
2020 |
Agrawal, Shweta |
| On Computational Shortcuts for Information-Theoretic PIR
|
2020 |
Hong, Matthew M. |
| Characterizing Deterministic-Prover Zero Knowledge
|
2020 |
Bitansky, Nir |
| Multi-key Fully-Homomorphic Encryption in the Plain Model
|
2020 |
Ananth, Prabhanjan |
| Functional Encryption for Quadratic Functions from k-Lin, Revisited
|
2020 |
Wee, Hoeteck |
| Blockchains from Non-idealized Hash Functions
|
2020 |
Garay, Juan A. |
| Lower Bounds for Multi-server Oblivious RAMs
|
2020 |
Larsen, Kasper Green |
| A Lower Bound for One-Round Oblivious RAM
|
2020 |
Cash, David |
Tag hinzufügen