Zvika Brakerski
where else to find them
no profile links on file
what they talk about
where they keep going back
- ITCS2 editions2022–2023
all 4 in the filters
on a stage with
- Luowen Qianonce
- Ran Canettionce
- Vinod Vaikuntanathanonce
who talks about the same things
- Vinod Vaikuntanathan6 talks
- Anubhav Baweja3 talks
- Yuval Filmus9 talks
- Tjerand Silde4 talks
- Yuval Ishai8 talks
- Tushant Mittal2 talks
| title | conference | date |
|---|---|---|
| Black-Hole Radiation Decoding as a Cryptographic Assumption | Minimal Complexity Assumptions for Cryptography 2023 | 2023-05-01 |
Claims an existential equivalence between the hardness of decoding Hawking radiation and the existence of basic quantum cryptography, showing hardness of the… | ||
| On the computational hardness needed for quantum cryptography | ITCS 2023 | 2023-01-10 |
Defines EFI pairs (efficiently sampleable, statistically far but quantumly indistinguishable mixed states) and shows they imply commitments, oblivious… | ||
| Lattice-Inspired Broadcast Encryption and Succinct Ciphertext-Policy ABE | ITCS 2022 | 2022-01-31 |
Constructs a lattice-inspired candidate that aims for polylogarithmic ciphertext size for broadcast encryption and ciphertext-policy ABE, built by flipping a… | ||
| Quantum Garbled Circuits | Quantum Wave in Computing Reunion 2021 | 2021-07-15 |
Defines quantum randomized encoding (decomposable, gate-by-gate) and constructs random Clifford + classical side information encodings that decode to the… | ||
| Fully Homomorphic Encryption | The Mathematics of Modern Cryptography | 2015-07-06 |
Defines a leveled fully homomorphic scheme built from the learning with errors assumption that encodes messages as eigenvalues for a secret approximate… | ||
| nothing matches | ||