| Publication | Date of Publication | Type |
|---|
Universally composable almost-everywhere secure computation
Journal of Cryptology | 2026-01-23 | Paper |
| Adaptive security, erasures, and network assumptions in communication-local MPC | 2025-07-23 | Paper |
| Universally composable almost-everywhere secure computation | 2024-06-25 | Paper |
Short leakage resilient and non-malleable secret sharing schemes
Advances in Cryptology – CRYPTO 2022 | 2023-06-12 | Paper |
| Adaptive extractors and their application to leakage resilient secret sharing | 2022-04-22 | Paper |
| Function secret sharing for mixed-mode and fixed-point secure computation | 2021-12-08 | Paper |
| Universally composable secure computation with corrupted tokens | 2020-03-09 | Paper |
Improved algorithms for optimal embeddings
ACM Transactions on Algorithms | 2018-11-05 | Paper |
| scientific article; zbMATH DE number 6866298 (Why is no real title available?) | 2018-05-03 | Paper |
| Block-wise non-malleable codes | 2017-12-19 | Paper |
The hidden graph model: communication locality and optimal resiliency with adaptive faults
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science | 2017-05-19 | Paper |
Reducing depth in constrained PRFs: from bit-fixing to \(\mathbf {NC}^{1}\)
Public-Key Cryptography – PKC 2016 | 2016-04-13 | Paper |
Information-Theoretic Local Non-malleable Codes and Their Applications
Theory of Cryptography | 2016-04-08 | Paper |
Almost-everywhere secure computation with edge corruptions
Journal of Cryptology | 2016-01-11 | Paper |
Balancing output length and query bound in hardness preserving constructions of pseudorandom functions
Progress in Cryptology -- INDOCRYPT 2014 | 2015-09-10 | Paper |
Privacy amplification with asymptotically optimal entropy loss
Journal of the ACM | 2015-08-14 | Paper |
Position-based cryptography
SIAM Journal on Computing | 2014-11-14 | Paper |
Privacy amplification with asymptotically optimal entropy loss
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
Position-based quantum cryptography: impossibility and constructions
SIAM Journal on Computing | 2014-06-04 | Paper |
Achieving privacy in verifiable computation with multiple servers -- without FHE and without pre-processing
Public-Key Cryptography – PKC 2014 | 2014-03-25 | Paper |
Re-encryption, functional re-encryption, and multi-hop re-encryption: a framework for achieving obfuscation-based security and instantiations from lattices
Public-Key Cryptography – PKC 2014 | 2014-03-25 | Paper |
Locally updatable and locally decodable codes
Theory of Cryptography | 2014-02-18 | Paper |
Edge Fault Tolerance on Sparse Networks
Automata, Languages, and Programming | 2012-11-01 | Paper |
Functional Re-encryption and Collusion-Resistant Obfuscation
Theory of Cryptography | 2012-06-15 | Paper |
Position-based quantum cryptography: impossibility and constructions
Advances in Cryptology – CRYPTO 2011 | 2011-08-12 | Paper |
Public-Key Encryption with Efficient Amortized Updates
Lecture Notes in Computer Science | 2010-09-10 | Paper |
Improved fault tolerance and secure computation on sparse networks
Automata, Languages and Programming | 2010-09-07 | Paper |
Position Based Cryptography
Advances in Cryptology - CRYPTO 2009 | 2009-10-20 | Paper |
A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks
Advances in Cryptology - EUROCRYPT 2009 | 2009-05-12 | Paper |
New Constructions for UC Secure Computation Using Tamper-Proof Hardware
Advances in Cryptology – EUROCRYPT 2008 | 2008-04-15 | Paper |
Ring Signatures of Sub-linear Size Without Random Oracles
Automata, Languages and Programming | 2007-11-28 | Paper |
