| Publication | Date of Publication | Type |
|---|
Stochastic secret sharing with 1-bit shares and applications to MPC
| 2024-12-13 | Paper |
Conflict checkable and decodable codes and their applications
| 2024-11-28 | Paper |
The round complexity of statistical MPC with optimal resiliency
| 2024-05-08 | Paper |
Succinct computational secret sharing
| 2024-05-08 | Paper |
scientific article; zbMATH DE number 7829240 (Why is no real title available?)
| 2024-04-09 | Paper |
How to recover a secret with \(O(n)\) additions
Advances in Cryptology – CRYPTO 2023 | 2024-02-02 | Paper |
Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error
SIAM Journal on Computing | 2023-12-15 | Paper |
Actively secure arithmetic computation and VOLE with constant computational overhead
Advances in Cryptology – EUROCRYPT 2023 | 2023-12-08 | Paper |
Round-optimal honest-majority MPC in Minicrypt and with everlasting security (extended abstract)
Theory of Cryptography | 2023-08-14 | Paper |
Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: trading NIZKs with honest majority (extended abstract)
Advances in Cryptology – CRYPTO 2022 | 2023-07-07 | Paper |
Quadratic multiparty randomized encodings beyond honest majority and their applications
Advances in Cryptology – CRYPTO 2022 | 2023-07-07 | Paper |
scientific article; zbMATH DE number 7706036 (Why is no real title available?)
| 2023-07-03 | Paper |
Correction to: ``Locally computable UOWHF with linear shrinkage
Journal of Cryptology | 2023-04-13 | Paper |
On actively-secure elementary MPC reductions
| 2023-03-31 | Paper |
scientific article; zbMATH DE number 7650419 (Why is no real title available?)
| 2023-02-03 | Paper |
scientific article; zbMATH DE number 7559047 (Why is no real title available?)
| 2022-07-18 | Paper |
Upslices, downslices, and secret-sharing with complexity of \(1.5^n\)
| 2022-04-22 | Paper |
The resiliency of MPC with low interaction: the benefit of making errors (extended abstract)
| 2022-03-23 | Paper |
On the Power of Amortization in Secret Sharing
ACM Transactions on Computation Theory | 2022-03-07 | Paper |
Garbled circuits as randomized encodings of functions: a primer
Tutorials on the Foundations of Cryptography | 2022-01-12 | Paper |
Obfuscating circuits via composite-order graded encoding
Journal of Cryptology | 2021-07-02 | Paper |
Placing conditional disclosure of secrets in the communication complexity universe
Journal of Cryptology | 2021-06-28 | Paper |
Perfect secure computation in two rounds
SIAM Journal on Computing | 2021-02-08 | Paper |
Conditional disclosure of secrets: amplification, closure, amortization, lower-bounds, and separations
SIAM Journal on Computing | 2021-02-08 | Paper |
Better secret sharing via robust conditional disclosure of secrets
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
The communication complexity of private simultaneous messages, revisited
Journal of Cryptology | 2020-06-15 | Paper |
Degree 2 is complete for the round-complexity of malicious MPC
| 2020-02-06 | Paper |
Secret-sharing schemes for general and uniform access structures
| 2020-02-04 | Paper |
On the relationship between statistical zero-knowledge and statistical randomized encodings
Computational Complexity | 2019-12-19 | Paper |
Perfect secure computation in two rounds
| 2018-12-11 | Paper |
On the power of amortization in secret sharing: \(d\)-uniform secret sharing and CDS with constant information rate
| 2018-12-11 | Paper |
The communication complexity of private simultaneous messages, revisited
Advances in Cryptology – EUROCRYPT 2018 | 2018-07-09 | Paper |
Explicit rateless codes for memoryless binary-input output-symmetric channels
Theory of Computing | 2018-06-15 | Paper |
Arithmetic cryptography
Journal of the ACM | 2018-05-17 | Paper |
Low-complexity cryptographic hash functions
| 2018-05-03 | Paper |
Minimizing locality of one-way functions via semi-private randomized encodings
Journal of Cryptology | 2018-04-26 | Paper |
From private simultaneous messages to zero-information Arthur-Merlin protocols and back
Journal of Cryptology | 2018-02-15 | Paper |
Incompressible functions, relative-error extractors, and the power of nondeterministic reductions (extended abstract)
| 2018-01-24 | Paper |
Algebraic attacks against random local functions and their countermeasures
SIAM Journal on Computing | 2018-01-12 | Paper |
Clique here: on the distributed complexity in fully-connected networks
Parallel Processing Letters | 2017-12-15 | Paper |
Conditional disclosure of secrets: amplification, closure, amortization, lower-bounds, and separations
| 2017-11-03 | Paper |
Locally computable UOWHF with linear shrinkage
Journal of Cryptology | 2017-10-12 | Paper |
Algebraic attacks against random local functions and their countermeasures
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
Arithmetic cryptography (extended abstract)
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science | 2017-05-19 | Paper |
Deterministic rateless codes for BSC
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science | 2017-05-19 | Paper |
Encoding functions with constant online rate, or how to compress garbled circuit keys
SIAM Journal on Computing | 2017-01-13 | Paper |
Fast pseudorandom functions based on expander graphs
Theory of Cryptography | 2016-12-21 | Paper |
On the relationship between statistical zero-knowledge and statistical randomized encodings
Advances in Cryptology – CRYPTO 2016 | 2016-11-09 | Paper |
Cryptographic hardness of random local functions. Survey
Computational Complexity | 2016-10-28 | Paper |
Garbling XOR gates ``for free in the standard model
Journal of Cryptology | 2016-09-21 | Paper |
A dichotomy for local small-bias generators
Journal of Cryptology | 2016-09-21 | Paper |
Incompressible functions, relative-error extractors, and the power of nondeterministic reductions
Computational Complexity | 2016-06-30 | Paper |
From private simultaneous messages to zero-information Arthur-Merlin protocols and back
Theory of Cryptography | 2016-04-08 | Paper |
Obfuscating circuits via composite-order graded encoding
Theory of Cryptography | 2015-07-06 | Paper |
Bootstrapping Obfuscators via Fast Pseudorandom Functions
Lecture Notes in Computer Science | 2015-01-06 | Paper |
Key-dependent message security: generic amplification and completeness
Journal of Cryptology | 2014-09-25 | Paper |
Public-key cryptography from different assumptions
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
How to Garble Arithmetic Circuits
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
How to garble arithmetic circuits
SIAM Journal on Computing | 2014-07-30 | Paper |
Pseudorandom generators with long stretch and low locality from random local one-way functions
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
Pseudorandom generators with long stretch and low locality from random local one-way functions
SIAM Journal on Computing | 2014-02-04 | Paper |
Encoding functions with constant online rate or how to compress garbled circuits keys
Advances in Cryptology – CRYPTO 2013 | 2013-09-17 | Paper |
Locally computable UOWHF with linear shrinkage
Advances in cryptology -- EUROCRYPT 2013. 32nd annual international conference on the theory and applications of cryptographic techniques, Athens, Greece, May 26--30, 2013. Proceedings | 2013-05-31 | Paper |
Cryptographic hardness of random local functions -- survey
Theory of Cryptography | 2013-03-18 | Paper |
Garbling XOR gates ``for free in the standard model
Theory of Cryptography | 2013-03-18 | Paper |
A dichotomy for local small-bias generators
Theory of Cryptography | 2012-06-15 | Paper |
Key-dependent message security: generic amplification and completeness
Advances in Cryptology – EUROCRYPT 2011 | 2011-05-27 | Paper |
Randomly encoding functions: a new cryptographic paradigm. (Invited talk)
Lecture Notes in Computer Science | 2011-05-19 | Paper |
Cryptography in constant parallel time
Information Security and Cryptography | 2011-02-14 | Paper |
From secrecy to soundness: efficient verification via secure computation (extended abstract)
Automata, Languages and Programming | 2010-09-07 | Paper |
Cryptography with constant input locality
Journal of Cryptology | 2009-11-13 | Paper |
Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
Advances in Cryptology - CRYPTO 2009 | 2009-10-20 | Paper |
Cryptography with Constant Input Locality
Advances in Cryptology - CRYPTO 2007 | 2009-03-10 | Paper |
On pseudorandom generators with linear stretch in \(\mathrm{NC}^{0}\)
Computational Complexity | 2008-08-20 | Paper |
Computationally private randomizing polynomials and their applications
Computational Complexity | 2007-11-05 | Paper |
Cryptography in $NC^0$
SIAM Journal on Computing | 2007-09-07 | Paper |
On Pseudorandom Generators with Linear Stretch in NC0
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2007-08-28 | Paper |
