| Publication | Date of Publication | Type |
|---|
| On the impossibility of general parallel fast-forwarding of Hamiltonian simulation | 2024-11-19 | Paper |
| Best-of-both-worlds multiparty quantum computation with publicly verifiable identifiable abort | 2024-11-13 | Paper |
| On the (im)possibility of time-lock puzzles in the quantum random oracle model | 2024-09-13 | Paper |
On the need for large quantum depth
Journal of the ACM | 2024-07-04 | Paper |
Black-box separations for non-interactive classical commitments in a quantum world
Advances in Cryptology – EUROCRYPT 2023 | 2024-01-16 | Paper |
scientific article; zbMATH DE number 7759460 (Why is no real title available?)
(available as arXiv preprint) | 2023-11-02 | Paper |
Collusion-resistant functional encryption for RAMs
Advances in Cryptology – ASIACRYPT 2022 | 2023-08-25 | Paper |
A note on the post-quantum security of (ring) signatures
Public-Key Cryptography – PKC 2022 | 2023-08-10 | Paper |
Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round
Advances in Cryptology – CRYPTO 2022 | 2023-06-30 | Paper |
On the impossibility of key agreements from quantum random oracles
Advances in Cryptology – CRYPTO 2022 | 2023-06-28 | Paper |
scientific article; zbMATH DE number 7701523 (Why is no real title available?)
(available as arXiv preprint) | 2023-06-26 | Paper |
Foundations of Differentially Oblivious Algorithms
Journal of the ACM | 2023-04-27 | Paper |
| MPC for MPC: Secure Computation on a Massively Parallel Computing Architecture | 2023-02-03 | Paper |
Constant-round blind classical verification of quantum sampling
(available as arXiv preprint) | 2022-08-30 | Paper |
On the Algorithmic Power of Spiking Neural Networks
(available as arXiv preprint) | 2022-07-18 | Paper |
| Game-theoretic fairness meets multi-party protocols: the case of leader election | 2022-04-22 | Paper |
A black-box approach to post-quantum zero-knowledge in constant rounds
(available as arXiv preprint) | 2022-03-31 | Paper |
On the concurrent composition of quantum zero-knowledge
(available as arXiv preprint) | 2022-03-31 | Paper |
| Round efficient secure multiparty quantum computation with identifiable abort | 2022-03-31 | Paper |
Classical verification of quantum computations with efficient verifier
(available as arXiv preprint) | 2022-03-23 | Paper |
| When Simple Hash Functions Suffice | 2022-02-04 | Paper |
On the compressed-oracle technique, and post-quantum security of proofs of sequential work
(available as arXiv preprint) | 2021-12-08 | Paper |
On the need for large Quantum depth
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
| Adaptively secure garbling schemes for parallel computations | 2020-04-30 | Paper |
A quantum-proof non-malleable extractor. With application to privacy amplification against active quantum adversaries
(available as arXiv preprint) | 2020-02-06 | Paper |
On quantum advantage in information theoretic single-server PIR
(available as arXiv preprint) | 2020-02-04 | Paper |
Foundations of differentially oblivious algorithms
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Quantum encryption and generalized Shannon impossibility
Designs, Codes and Cryptography | 2019-09-12 | Paper |
| Game theoretic notions of fairness in multi-party coin toss | 2018-12-11 | Paper |
| On the complexity of simulating auxiliary input | 2018-07-17 | Paper |
| On the depth of oblivious parallel RAM | 2018-04-06 | Paper |
scientific article; zbMATH DE number 6829293 (Why is no real title available?)
(available as arXiv preprint) | 2018-01-24 | Paper |
On the impossibility of cryptography with tamperable randomness
Algorithmica | 2018-01-05 | Paper |
Distributed algorithms for the Lovász local lemma and graph coloring
Distributed Computing | 2017-09-04 | Paper |
On the power of nonuniformity in proofs of security
Proceedings of the 4th conference on Innovations in Theoretical Computer Science | 2017-05-16 | Paper |
Can theories be tested?
Proceedings of the 4th conference on Innovations in Theoretical Computer Science | 2017-05-16 | Paper |
Delegating RAM computations with adaptive soundness and privacy
Theory of Cryptography | 2016-12-22 | Paper |
Non-black-box simulation from one-way functions and applications to resettable security
SIAM Journal on Computing | 2016-04-25 | Paper |
Cryptography for parallel RAM from indistinguishability obfuscation
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science | 2016-04-15 | Paper |
Oblivious parallel RAM and applications
Theory of Cryptography | 2016-04-08 | Paper |
Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs
Lecture Notes in Computer Science | 2015-12-10 | Paper |
Constant-round concurrent zero-knowledge from indistinguishability obfuscation
Lecture Notes in Computer Science | 2015-12-10 | Paper |
Distributed algorithms for the Lovász local lemma and graph coloring
Proceedings of the 2014 ACM symposium on Principles of distributed computing | 2015-09-03 | Paper |
Tight parallel repetition theorems for public-coin arguments using KL-divergence
Theory of Cryptography | 2015-07-06 | Paper |
From weak to strong zero-knowledge and applications
Theory of Cryptography | 2015-07-06 | Paper |
Statistically-secure ORAM with \(\tilde{O}(\log^2 n)\) overhead
Lecture Notes in Computer Science | 2015-01-06 | Paper |
scientific article; zbMATH DE number 6351507 (Why is no real title available?)
Theory of Computing | 2014-10-06 | Paper |
\(s\)-\(t\) connectivity on digraphs with a known stationary distribution
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Non-black-box simulation from one-way functions and applications to resettable security
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
On the impossibility of cryptography with tamperable randomness
Advances in Cryptology – CRYPTO 2014 | 2014-08-07 | Paper |
The Randomness Complexity of Parallel Repetition
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
4-round resettably-sound zero knowledge
Theory of Cryptography | 2014-02-18 | Paper |
On extractability obfuscation
Theory of Cryptography | 2014-02-18 | Paper |
Functional encryption from (small) hardware tokens
Advances in Cryptology - ASIACRYPT 2013 | 2013-12-10 | Paper |
Randomness-dependent message security
Theory of Cryptography | 2013-03-18 | Paper |
Chernoff-Hoeffding bounds for Markov chains: generalized and simplified
(available as arXiv preprint) | 2012-08-23 | Paper |
The knowledge tightness of parallel zero-knowledge
Theory of Cryptography | 2012-06-15 | Paper |
| AMS without 4-wise independence on product domains | 2012-01-23 | Paper |
Memory delegation
Advances in Cryptology – CRYPTO 2011 | 2011-08-12 | Paper |
Efficient secure two-party exponentiation
Topics in Cryptology – CT-RSA 2011 | 2011-02-11 | Paper |
Efficient string-commitment from weak bit-commitment
Advances in Cryptology - ASIACRYPT 2010 | 2010-12-07 | Paper |
Improved delegation of computation using fully homomorphic encryption
Advances in Cryptology – CRYPTO 2010 | 2010-08-24 | Paper |
An optimal algorithm for the maximum-density segment problem
Lecture Notes in Computer Science | 2010-03-03 | Paper |
Parallel repetition theorems for interactive arguments
Theory of Cryptography | 2010-02-24 | Paper |
Tight Bounds for Hashing Block Sources
Lecture Notes in Computer Science | 2008-11-27 | Paper |
An Optimal Algorithm for the Maximum-Density Segment Problem
SIAM Journal on Computing | 2005-02-21 | Paper |
Decomposition Methods for Linear Support Vector Machines
Neural Computation | 2005-01-04 | Paper |
Radius Margin Bounds for Support Vector Machines with the RBF Kernel
Neural Computation | 2004-09-07 | Paper |
