| Publication | Date of Publication | Type |
|---|
Structural lower bounds on black-box constructions of pseudorandom functions
| 2024-12-13 | Paper |
Lower bounds for secret-sharing schemes for \(k\)-hypergraphs
| 2024-11-22 | Paper |
Complete characterization of fairness in secure two-party computation of Boolean functions
SIAM Journal on Computing | 2024-10-21 | Paper |
Three party secure computation with friends and foes
| 2024-08-02 | Paper |
Improved polynomial secret-sharing schemes
| 2024-08-02 | Paper |
Cryptography from planted graphs: security with logarithmic-size messages
| 2024-08-01 | Paper |
Quadratic secret sharing and conditional disclosure of secrets
IEEE Transactions on Information Theory | 2024-07-21 | 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 |
Dynamic algorithms against an adaptive adversary: generic constructions and lower bounds
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
The power of synergy in differential privacy: combining a small curator with local randomizers
| 2023-11-02 | Paper |
scientific article; zbMATH DE number 7650132 (Why is no real title available?)
| 2023-02-03 | Paper |
Tighter bounds on multiparty coin flipping via augmented weak martingales and differentially private sampling
SIAM Journal on Computing | 2022-08-12 | Paper |
Linear Secret-Sharing Schemes for Forbidden Graph Access Structures
IEEE Transactions on Information Theory | 2022-05-30 | Paper |
Quadratic secret sharing and conditional disclosure of secrets
| 2022-04-22 | Paper |
On the round complexity of the shuffle model
| 2022-03-23 | Paper |
The share size of secret-sharing schemes for almost all access structures and graphs
| 2022-03-23 | Paper |
Evolving ramp secret sharing with a small gap
| 2021-12-01 | Paper |
Learning privately with labeled and unlabeled examples
Algorithmica | 2021-02-01 | 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 |
\(1/p\)-secure multiparty computation without an honest majority and the best of both worlds
Journal of Cryptology | 2020-11-06 | Paper |
scientific article; zbMATH DE number 7164746 (Why is no real title available?)
| 2020-02-07 | Paper |
Secret-sharing schemes for general and uniform access structures
| 2020-02-04 | Paper |
Optimal linear multiparty conditional disclosure of secrets protocols
| 2019-01-23 | Paper |
Evolving ramp secret-sharing schemes
| 2018-10-17 | Paper |
The complexity of multiparty PSM protocols and related models
| 2018-07-09 | Paper |
Linear secret-sharing schemes for forbidden graph access structures
| 2018-01-19 | Paper |
Learning Privately with Labeled and Unlabeled Examples
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
Secret Sharing and Non-Shannon Information Inequalities
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Ad hoc PSM protocols: secure computation without coordination
Lecture Notes in Computer Science | 2017-06-23 | Paper |
Characterizing the sample complexity of private learners
Proceedings of the 4th conference on Innovations in Theoretical Computer Science | 2017-05-16 | Paper |
Secret sharing schemes for dense forbidden graphs
Lecture Notes in Computer Science | 2016-10-21 | Paper |
One-way functions are essential for single-server private information retrieval
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
Private learning and sanitization: pure vs. approximate differential privacy
Theory of Computing | 2016-07-29 | Paper |
Learning unions of high-dimensional boxes over the reals
Information Processing Letters | 2016-06-16 | Paper |
Secret-sharing schemes for very dense graphs
Journal of Cryptology | 2016-06-01 | Paper |
Distribution design
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science | 2016-04-15 | Paper |
Efficient reliable communication over partially authenticated networks
Proceedings of the twenty-second annual symposium on Principles of distributed computing | 2015-09-04 | Paper |
Protocols for multiparty coin toss with a dishonest majority
Journal of Cryptology | 2015-08-03 | Paper |
Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions
Theory of Cryptography | 2015-07-06 | Paper |
Private approximation of search problems
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
Choosing, agreeing, and eliminating in communication complexity
Computational Complexity | 2014-09-25 | Paper |
Non-interactive secure multiparty computation
Advances in Cryptology – CRYPTO 2014 | 2014-08-07 | Paper |
Bounds on the sample complexity for private learning and private data release
Machine Learning | 2014-07-14 | Paper |
Multi-linear secret-sharing schemes
Theory of Cryptography | 2014-02-18 | Paper |
On the Cryptographic Complexity of the Worst Functions
Theory of Cryptography | 2014-02-18 | Paper |
Private Learning and Sanitization: Pure vs. Approximate Differential Privacy
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2013-10-04 | Paper |
On private computation in incomplete networks
Distributed Computing | 2013-06-20 | Paper |
Efficient reliable communication over partially authenticated networks
Distributed Computing | 2013-06-07 | Paper |
Secret sharing schemes for very dense graphs
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Communication-efficient distributed oblivious transfer
Journal of Computer and System Sciences | 2012-08-17 | Paper |
\(1/p\)-secure multiparty computation without honest majority and the best of both worlds
Advances in Cryptology – CRYPTO 2011 | 2011-08-12 | Paper |
Secret-Sharing Schemes: A Survey
Lecture Notes in Computer Science | 2011-06-08 | Paper |
Private approximation of clustering and vertex cover
Computational Complexity | 2011-02-18 | Paper |
Choosing, agreeing, and eliminating in communication complexity
Automata, Languages and Programming | 2010-09-07 | Paper |
Protocols for multiparty coin toss with dishonest majority
Advances in Cryptology – CRYPTO 2010 | 2010-08-24 | Paper |
How should we solve search problems privately?
Journal of Cryptology | 2010-03-01 | Paper |
Bounds on the sample complexity for private learning and private data release
Theory of Cryptography | 2010-02-24 | Paper |
Monotone circuits for monotone weighted threshold functions
Information Processing Letters | 2009-12-18 | Paper |
Private Approximation of Search Problems
SIAM Journal on Computing | 2009-11-06 | Paper |
Approximate belief updating in max-2-connected Bayes networks is NP-hard
Artificial Intelligence | 2009-09-14 | Paper |
Matrix columns allocation problems
Theoretical Computer Science | 2009-05-28 | Paper |
Theory of Cryptography
Lecture Notes in Computer Science | 2009-05-14 | Paper |
Characterizing Ideal Weighted Threshold Secret Sharing
SIAM Journal on Discrete Mathematics | 2009-03-16 | Paper |
How Should We Solve Search Problems Privately?
Advances in Cryptology - CRYPTO 2007 | 2009-03-10 | Paper |
Secret Sharing and Non-Shannon Information Inequalities
Theory of Cryptography | 2009-03-03 | Paper |
On Matroids and Nonideal Secret Sharing
IEEE Transactions on Information Theory | 2009-02-24 | Paper |
Distributed Private Data Analysis: Simultaneously Solving How and What
Lecture Notes in Computer Science | 2009-02-10 | Paper |
Edge Eavesdropping Games
Lecture Notes in Computer Science | 2008-11-27 | Paper |
On Linear Secret Sharing for Connectivity in Directed Graphs
Lecture Notes in Computer Science | 2008-11-20 | Paper |
Matroids Can Be Far from Ideal Secret Sharing
Theory of Cryptography | 2008-03-05 | Paper |
Private Approximation of Clustering and Vertex Cover
Theory of Cryptography | 2007-08-30 | Paper |
Weakly-Private Secret Sharing Schemes
Theory of Cryptography | 2007-08-30 | Paper |
Robust information-theoretic private information retrieval
Journal of Cryptology | 2007-08-20 | Paper |
Theory of Cryptography
Lecture Notes in Computer Science | 2007-02-12 | Paper |
Theory of Cryptography
Lecture Notes in Computer Science | 2005-12-07 | Paper |
Structural Information and Communication Complexity
Lecture Notes in Computer Science | 2005-11-30 | Paper |
Separating the Power of Monotone Span Programs over Different Fields
SIAM Journal on Computing | 2005-09-16 | Paper |
On the Power of Nonlinear Secret-Sharing
SIAM Journal on Discrete Mathematics | 2005-09-16 | Paper |
General constructions for information-theoretic private information retrieval
Journal of Computer and System Sciences | 2005-08-03 | Paper |
Reducing the servers' computation in private information retrieval: PIR with preprocessing
Journal of Cryptology | 2004-09-27 | Paper |
Buses for anonymous message delivery
Journal of Cryptology | 2003-08-27 | Paper |
scientific article; zbMATH DE number 1952910 (Why is no real title available?)
| 2003-07-24 | Paper |
Learning functions represented as multiplicity automata
Journal of the ACM | 2003-06-25 | Paper |
The query complexity of finding local minima in the lattice
Information and Computation | 2003-01-14 | Paper |
scientific article; zbMATH DE number 1759771 (Why is no real title available?)
| 2002-07-28 | Paper |
scientific article; zbMATH DE number 1754644 (Why is no real title available?)
| 2002-06-12 | Paper |
On arithmetic branching programs
Journal of Computer and System Sciences | 2000-11-22 | Paper |
scientific article; zbMATH DE number 1418289 (Why is no real title available?)
| 2000-07-26 | Paper |
Computing Functions of a Shared Secret
SIAM Journal on Discrete Mathematics | 2000-07-20 | Paper |
Secret Sharing With Public Reconstruction
IEEE Transactions on Information Theory | 1999-11-21 | Paper |
scientific article; zbMATH DE number 1335881 (Why is no real title available?)
| 1999-09-13 | Paper |
scientific article; zbMATH DE number 1306900 (Why is no real title available?)
| 1999-08-31 | Paper |
scientific article; zbMATH DE number 708805 (Why is no real title available?)
| 1999-08-29 | Paper |
Reliable communication over partially authenticated networks
Theoretical Computer Science | 1999-06-21 | Paper |
Learning boxes in high dimension
Algorithmica | 1999-05-18 | Paper |
scientific article; zbMATH DE number 1031004 (Why is no real title available?)
| 1997-12-01 | Paper |
Lower bounds for monotone span programs
Computational Complexity | 1997-09-07 | Paper |
scientific article; zbMATH DE number 1024077 (Why is no real title available?)
| 1997-07-20 | Paper |
Communication in key distribution schemes
IEEE Transactions on Information Theory | 1996-06-02 | Paper |
Universally ideal secret-sharing schemes
IEEE Transactions on Information Theory | 1995-07-12 | Paper |
