Daniel Genkin

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Snapshot-oblivious RAMs: sub-logarithmic efficiency for short transcripts Advances in Cryptology – CRYPTO 2022	2023-07-07	Paper
Fast large-scale honest-majority MPC for malicious adversaries Journal of Cryptology	2023-07-05	Paper
Side-channeling the \textsf{Kalyna} key expansion	2022-07-06	Paper
Fast large-scale honest-majority MPC for malicious adversaries	2020-06-30	Paper
Sliding right into disaster: left-to-right sliding windows leak Lecture Notes in Computer Science	2020-06-24	Paper
Closure under reversal of languages over infinite alphabets	2018-11-28	Paper
Best of both worlds in secure computation, with low communication overhead	2018-08-10	Paper
Stealing keys from PCs using a radio: cheap electromagnetic attacks on windowed exponentiation	2018-02-14	Paper
How to construct a leakage-resilient (stateless) trusted party	2018-01-19	Paper
Computational integrity with a public random string from quasi-linear PCPs Lecture Notes in Computer Science	2017-06-23	Paper
Acoustic cryptanalysis Journal of Cryptology	2017-05-22	Paper
Fast reductions from RAMs to delegatable succinct constraint satisfaction problems Proceedings of the 4th conference on Innovations in Theoretical Computer Science	2017-05-16	Paper
Binary AMD circuits from secure multiparty computation Theory of Cryptography	2016-12-21	Paper
ECDH key-extraction via low-bandwidth electromagnetic attacks on PCs Topics in Cryptology - CT-RSA 2016	2016-04-08	Paper
Efficient multi-party computation: from passive to active security via secure SIMD circuits Lecture Notes in Computer Science	2015-12-10	Paper
Circuits resilient to additive attacks with applications to secure computation Proceedings of the forty-sixth annual ACM symposium on Theory of computing	2015-06-26	Paper
On the concrete efficiency of probabilistically-checkable proofs Proceedings of the forty-eighth annual ACM symposium on Theory of Computing	2014-08-07	Paper
RSA key extraction via low-bandwidth acoustic cryptanalysis Advances in Cryptology – CRYPTO 2014	2014-08-07	Paper
A note on the emptiness problem for alternating finite-memory automata Theoretical Computer Science	2014-03-13	Paper
Snarks for C: verifying program executions succinctly and in zero knowledge Advances in Cryptology – CRYPTO 2013	2013-09-17	Paper
Extending free pregroups with lower bounds Studia Logica	2010-09-20	Paper
Mildly context-sensitive languages via buffer augmented pregroup grammars Time for Verification	2010-09-07	Paper

Research outcomes over time

This page was built for person: Daniel Genkin