BibTeX records: Amos Beimel

download as .bib file

@article{DBLP:journals/iacr/AlonBDOP24,
  author       = {Bar Alon and
                  Amos Beimel and
                  Tamar Ben David and
                  Eran Omri and
                  Anat Paskin{-}Cherniavsky},
  title        = {New Upper Bounds for Evolving Secret Sharing via Infinite Branching
                  Programs},
  journal      = {{IACR} Cryptol. ePrint Arch.},
  pages        = {419},
  year         = {2024},
  url          = {https://eprint.iacr.org/2024/419},
  timestamp    = {Mon, 18 Mar 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iacr/AlonBDOP24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/BeimelOP23,
  author       = {Amos Beimel and
                  Hussien Othman and
                  Naty Peter},
  title        = {Quadratic Secret Sharing and Conditional Disclosure of Secrets},
  journal      = {{IEEE} Trans. Inf. Theory},
  volume       = {69},
  number       = {11},
  pages        = {7295--7316},
  year         = {2023},
  url          = {https://doi.org/10.1109/TIT.2023.3296588},
  doi          = {10.1109/TIT.2023.3296588},
  timestamp    = {Thu, 09 Nov 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tit/BeimelOP23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/citc/Beimel23,
  author       = {Amos Beimel},
  editor       = {Kai{-}Min Chung},
  title        = {Lower Bounds for Secret-Sharing Schemes for k-Hypergraphs},
  booktitle    = {4th Conference on Information-Theoretic Cryptography, {ITC} 2023,
                  June 6-8, 2023, Aarhus University, Aarhus, Denmark},
  series       = {LIPIcs},
  volume       = {267},
  pages        = {16:1--16:13},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2023},
  url          = {https://doi.org/10.4230/LIPIcs.ITC.2023.16},
  doi          = {10.4230/LIPICS.ITC.2023.16},
  timestamp    = {Tue, 25 Jul 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/citc/Beimel23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ApplebaumBIKLV23,
  author       = {Benny Applebaum and
                  Amos Beimel and
                  Yuval Ishai and
                  Eyal Kushilevitz and
                  Tianren Liu and
                  Vinod Vaikuntanathan},
  editor       = {Barna Saha and
                  Rocco A. Servedio},
  title        = {Succinct Computational Secret Sharing},
  booktitle    = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
                  {STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
  pages        = {1553--1566},
  publisher    = {{ACM}},
  year         = {2023},
  url          = {https://doi.org/10.1145/3564246.3585127},
  doi          = {10.1145/3564246.3585127},
  timestamp    = {Mon, 22 May 2023 13:01:48 +0200},
  biburl       = {https://dblp.org/rec/conf/stoc/ApplebaumBIKLV23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tcc/AlonBO23,
  author       = {Bar Alon and
                  Amos Beimel and
                  Eran Omri},
  editor       = {Guy N. Rothblum and
                  Hoeteck Wee},
  title        = {Three Party Secure Computation with Friends and Foes},
  booktitle    = {Theory of Cryptography - 21st International Conference, {TCC} 2023,
                  Taipei, Taiwan, November 29 - December 2, 2023, Proceedings, Part
                  {II}},
  series       = {Lecture Notes in Computer Science},
  volume       = {14370},
  pages        = {156--185},
  publisher    = {Springer},
  year         = {2023},
  url          = {https://doi.org/10.1007/978-3-031-48618-0\_6},
  doi          = {10.1007/978-3-031-48618-0\_6},
  timestamp    = {Sun, 10 Dec 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/tcc/AlonBO23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tcc/AbramBIKN23,
  author       = {Damiano Abram and
                  Amos Beimel and
                  Yuval Ishai and
                  Eyal Kushilevitz and
                  Varun Narayanan},
  editor       = {Guy N. Rothblum and
                  Hoeteck Wee},
  title        = {Cryptography from Planted Graphs: Security with Logarithmic-Size Messages},
  booktitle    = {Theory of Cryptography - 21st International Conference, {TCC} 2023,
                  Taipei, Taiwan, November 29 - December 2, 2023, Proceedings, Part
                  {I}},
  series       = {Lecture Notes in Computer Science},
  volume       = {14369},
  pages        = {286--315},
  publisher    = {Springer},
  year         = {2023},
  url          = {https://doi.org/10.1007/978-3-031-48615-9\_11},
  doi          = {10.1007/978-3-031-48615-9\_11},
  timestamp    = {Sun, 31 Dec 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/tcc/AbramBIKN23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tcc/BeimelFL23,
  author       = {Amos Beimel and
                  Oriol Farr{\`{a}}s and
                  Or Lasri},
  editor       = {Guy N. Rothblum and
                  Hoeteck Wee},
  title        = {Improved Polynomial Secret-Sharing Schemes},
  booktitle    = {Theory of Cryptography - 21st International Conference, {TCC} 2023,
                  Taipei, Taiwan, November 29 - December 2, 2023, Proceedings, Part
                  {II}},
  series       = {Lecture Notes in Computer Science},
  volume       = {14370},
  pages        = {374--405},
  publisher    = {Springer},
  year         = {2023},
  url          = {https://doi.org/10.1007/978-3-031-48618-0\_13},
  doi          = {10.1007/978-3-031-48618-0\_13},
  timestamp    = {Sun, 31 Dec 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/tcc/BeimelFL23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ApplebaumBIKLV23,
  author       = {Benny Applebaum and
                  Amos Beimel and
                  Yuval Ishai and
                  Eyal Kushilevitz and
                  Tianren Liu and
                  Vinod Vaikuntanathan},
  title        = {Succinct Computational Secret Sharing},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR23-091}},
  year         = {2023},
  url          = {https://eccc.weizmann.ac.il/report/2023/091},
  eprinttype    = {ECCC},
  eprint       = {TR23-091},
  timestamp    = {Wed, 30 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/ApplebaumBIKLV23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/Beimel23,
  author       = {Amos Beimel},
  title        = {Lower-Bounds for Secret-Sharing Schemes for k-Hypergraphs},
  journal      = {{IACR} Cryptol. ePrint Arch.},
  pages        = {289},
  year         = {2023},
  url          = {https://eprint.iacr.org/2023/289},
  timestamp    = {Tue, 28 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iacr/Beimel23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/ApplebaumBIKLV23,
  author       = {Benny Applebaum and
                  Amos Beimel and
                  Yuval Ishai and
                  Eyal Kushilevitz and
                  Tianren Liu and
                  Vinod Vaikuntanathan},
  title        = {Succinct Computational Secret Sharing},
  journal      = {{IACR} Cryptol. ePrint Arch.},
  pages        = {955},
  year         = {2023},
  url          = {https://eprint.iacr.org/2023/955},
  timestamp    = {Mon, 03 Jul 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/iacr/ApplebaumBIKLV23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/BeimelFL23,
  author       = {Amos Beimel and
                  Oriol Farr{\`{a}}s and
                  Or Lasri},
  title        = {Improved Polynomial Secret-Sharing Schemes},
  journal      = {{IACR} Cryptol. ePrint Arch.},
  pages        = {1158},
  year         = {2023},
  url          = {https://eprint.iacr.org/2023/1158},
  timestamp    = {Fri, 04 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/iacr/BeimelFL23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/AlonBO23,
  author       = {Bar Alon and
                  Amos Beimel and
                  Eran Omri},
  title        = {Three Party Secure Computation with Friends and Foes},
  journal      = {{IACR} Cryptol. ePrint Arch.},
  pages        = {1605},
  year         = {2023},
  url          = {https://eprint.iacr.org/2023/1605},
  timestamp    = {Thu, 09 Nov 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iacr/AlonBO23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/AbramBIKN23,
  author       = {Damiano Abram and
                  Amos Beimel and
                  Yuval Ishai and
                  Eyal Kushilevitz and
                  Varun Narayanan},
  title        = {Cryptography from Planted Graphs: Security with Logarithmic-Size Messages},
  journal      = {{IACR} Cryptol. ePrint Arch.},
  pages        = {1929},
  year         = {2023},
  url          = {https://eprint.iacr.org/2023/1929},
  timestamp    = {Wed, 10 Jan 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iacr/AbramBIKN23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BeimelHMO22,
  author       = {Amos Beimel and
                  Iftach Haitner and
                  Nikolaos Makriyannis and
                  Eran Omri},
  title        = {Tighter Bounds on MultiParty Coin Flipping via Augmented Weak Martingales
                  and Differentially Private Sampling},
  journal      = {{SIAM} J. Comput.},
  volume       = {51},
  number       = {4},
  pages        = {1126--1171},
  year         = {2022},
  url          = {https://doi.org/10.1137/18m1210782},
  doi          = {10.1137/18M1210782},
  timestamp    = {Mon, 08 Aug 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/BeimelHMO22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/BeimelFMP22,
  author       = {Amos Beimel and
                  Oriol Farr{\`{a}}s and
                  Yuval Mintz and
                  Naty Peter},
  title        = {Linear Secret-Sharing Schemes for Forbidden Graph Access Structures},
  journal      = {{IEEE} Trans. Inf. Theory},
  volume       = {68},
  number       = {3},
  pages        = {2083--2100},
  year         = {2022},
  url          = {https://doi.org/10.1109/TIT.2021.3132917},
  doi          = {10.1109/TIT.2021.3132917},
  timestamp    = {Sat, 09 Apr 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tit/BeimelFMP22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/ApplebaumBNPP22,
  author       = {Benny Applebaum and
                  Amos Beimel and
                  Oded Nir and
                  Naty Peter and
                  Toniann Pitassi},
  editor       = {Mark Braverman},
  title        = {Secret Sharing, Slice Formulas, and Monotone Real Circuits},
  booktitle    = {13th Innovations in Theoretical Computer Science Conference, {ITCS}
                  2022, January 31 - February 3, 2022, Berkeley, CA, {USA}},
  series       = {LIPIcs},
  volume       = {215},
  pages        = {8:1--8:23},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2022},
  url          = {https://doi.org/10.4230/LIPIcs.ITCS.2022.8},
  doi          = {10.4230/LIPICS.ITCS.2022.8},
  timestamp    = {Sat, 09 Apr 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/innovations/ApplebaumBNPP22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BeimelKMNSS22,
  author       = {Amos Beimel and
                  Haim Kaplan and
                  Yishay Mansour and
                  Kobbi Nissim and
                  Thatchaphol Saranurak and
                  Uri Stemmer},
  editor       = {Stefano Leonardi and
                  Anupam Gupta},
  title        = {Dynamic algorithms against an adaptive adversary: generic constructions
                  and lower bounds},
  booktitle    = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
                  Rome, Italy, June 20 - 24, 2022},
  pages        = {1671--1684},
  publisher    = {{ACM}},
  year         = {2022},
  url          = {https://doi.org/10.1145/3519935.3520064},
  doi          = {10.1145/3519935.3520064},
  timestamp    = {Sun, 12 Nov 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/BeimelKMNSS22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ApplebaumBNPP22,
  author       = {Benny Applebaum and
                  Amos Beimel and
                  Oded Nir and
                  Naty Peter and
                  Toniann Pitassi},
  title        = {Secret Sharing, Slice Formulas, and Monotone Real Circuits},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR22-006}},
  year         = {2022},
  url          = {https://eccc.weizmann.ac.il/report/2022/006},
  eprinttype    = {ECCC},
  eprint       = {TR22-006},
  timestamp    = {Wed, 16 Mar 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/eccc/ApplebaumBNPP22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BeimelNS21,
  author       = {Amos Beimel and
                  Kobbi Nissim and
                  Uri Stemmer},
  title        = {Learning Privately with Labeled and Unlabeled Examples},
  journal      = {Algorithmica},
  volume       = {83},
  number       = {1},
  pages        = {177--215},
  year         = {2021},
  url          = {https://doi.org/10.1007/s00453-020-00753-z},
  doi          = {10.1007/S00453-020-00753-Z},
  timestamp    = {Sat, 09 Apr 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/BeimelNS21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/crypto/BeimelOP21,
  author       = {Amos Beimel and
                  Hussien Othman and
                  Naty Peter},
  editor       = {Tal Malkin and
                  Chris Peikert},
  title        = {Quadratic Secret Sharing and Conditional Disclosure of Secrets},
  booktitle    = {Advances in Cryptology - {CRYPTO} 2021 - 41st Annual International
                  Cryptology Conference, {CRYPTO} 2021, Virtual Event, August 16-20,
                  2021, Proceedings, Part {III}},
  series       = {Lecture Notes in Computer Science},
  volume       = {12827},
  pages        = {748--778},
  publisher    = {Springer},
  year         = {2021},
  url          = {https://doi.org/10.1007/978-3-030-84252-9\_25},
  doi          = {10.1007/978-3-030-84252-9\_25},
  timestamp    = {Sat, 09 Apr 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/crypto/BeimelOP21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2105-00743,
  author       = {Amos Beimel and
                  Iftach Haitner and
                  Nikolaos Makriyannis and
                  Eran Omri},
  title        = {Tighter Bounds on Multi-Party Coin Flipping via Augmented Weak Martingales
                  and Differentially Private Sampling},
  journal      = {CoRR},
  volume       = {abs/2105.00743},
  year         = {2021},
  url          = {https://arxiv.org/abs/2105.00743},
  eprinttype    = {arXiv},
  eprint       = {2105.00743},
  timestamp    = {Wed, 12 May 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2105-00743.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2111-03980,
  author       = {Amos Beimel and
                  Haim Kaplan and
                  Yishay Mansour and
                  Kobbi Nissim and
                  Thatchaphol Saranurak and
                  Uri Stemmer},
  title        = {Dynamic Algorithms Against an Adaptive Adversary: Generic Constructions
                  and Lower Bounds},
  journal      = {CoRR},
  volume       = {abs/2111.03980},
  year         = {2021},
  url          = {https://arxiv.org/abs/2111.03980},
  eprinttype    = {arXiv},
  eprint       = {2111.03980},
  timestamp    = {Wed, 10 Nov 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2111-03980.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/BeimelOP21,
  author       = {Amos Beimel and
                  Hussien Othman and
                  Naty Peter},
  title        = {Degree-2 Secret Sharing and Conditional Disclosure of Secrets},
  journal      = {{IACR} Cryptol. ePrint Arch.},
  pages        = {285},
  year         = {2021},
  url          = {https://eprint.iacr.org/2021/285},
  timestamp    = {Wed, 07 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/iacr/BeimelOP21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/joc/BeimelLOO20,
  author       = {Amos Beimel and
                  Yehuda Lindell and
                  Eran Omri and
                  Ilan Orlov},
  title        = {1/p-Secure Multiparty Computation without an Honest Majority and the
                  Best of Both Worlds},
  journal      = {J. Cryptol.},
  volume       = {33},
  number       = {4},
  pages        = {1659--1731},
  year         = {2020},
  url          = {https://doi.org/10.1007/s00145-020-09354-z},
  doi          = {10.1007/S00145-020-09354-Z},
  timestamp    = {Sat, 09 Apr 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/joc/BeimelLOO20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/AlonBMS20,
  author       = {Noga Alon and
                  Amos Beimel and
                  Shay Moran and
                  Uri Stemmer},
  editor       = {Jacob D. Abernethy and
                  Shivani Agarwal},
  title        = {Closure Properties for Private Classification and Online Prediction},
  booktitle    = {Conference on Learning Theory, {COLT} 2020, 9-12 July 2020, Virtual
                  Event [Graz, Austria]},
  series       = {Proceedings of Machine Learning Research},
  volume       = {125},
  pages        = {119--152},
  publisher    = {{PMLR}},
  year         = {2020},
  url          = {http://proceedings.mlr.press/v125/alon20a.html},
  timestamp    = {Fri, 27 Nov 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/colt/AlonBMS20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/eurocrypt/BeimelO20,
  author       = {Amos Beimel and
                  Hussien Othman},
  editor       = {Anne Canteaut and
                  Yuval Ishai},
  title        = {Evolving Ramp Secret Sharing with a Small Gap},
  booktitle    = {Advances in Cryptology - {EUROCRYPT} 2020 - 39th Annual International
                  Conference on the Theory and Applications of Cryptographic Techniques,
                  Zagreb, Croatia, May 10-14, 2020, Proceedings, Part {I}},
  series       = {Lecture Notes in Computer Science},
  volume       = {12105},
  pages        = {529--555},
  publisher    = {Springer},
  year         = {2020},
  url          = {https://doi.org/10.1007/978-3-030-45721-1\_19},
  doi          = {10.1007/978-3-030-45721-1\_19},
  timestamp    = {Sat, 09 Apr 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/eurocrypt/BeimelO20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icits/BeimelKNSS20,
  author       = {Amos Beimel and
                  Aleksandra Korolova and
                  Kobbi Nissim and
                  Or Sheffet and
                  Uri Stemmer},
  editor       = {Yael Tauman Kalai and
                  Adam D. Smith and
                  Daniel Wichs},
  title        = {The Power of Synergy in Differential Privacy: Combining a Small Curator
                  with Local Randomizers},
  booktitle    = {1st Conference on Information-Theoretic Cryptography, {ITC} 2020,
                  June 17-19, 2020, Boston, MA, {USA}},
  series       = {LIPIcs},
  volume       = {163},
  pages        = {14:1--14:25},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2020},
  url          = {https://doi.org/10.4230/LIPIcs.ITC.2020.14},
  doi          = {10.4230/LIPICS.ITC.2020.14},
  timestamp    = {Thu, 16 Sep 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/icits/BeimelKNSS20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ApplebaumBNP20,
  author       = {Benny Applebaum and
                  Amos Beimel and
                  Oded Nir and
                  Naty Peter},
  editor       = {Konstantin Makarychev and
                  Yury Makarychev and
                  Madhur Tulsiani and
                  Gautam Kamath and
                  Julia Chuzhoy},
  title        = {Better secret sharing via robust conditional disclosure of secrets},
  booktitle    = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
                  of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
  pages        = {280--293},
  publisher    = {{ACM}},
  year         = {2020},
  url          = {https://doi.org/10.1145/3357713.3384293},
  doi          = {10.1145/3357713.3384293},
  timestamp    = {Mon, 18 Dec 2023 07:33:37 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/ApplebaumBNP20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tcc/BeimelF20,
  author       = {Amos Beimel and
                  Oriol Farr{\`{a}}s},
  editor       = {Rafael Pass and
                  Krzysztof Pietrzak},
  title        = {The Share Size of Secret-Sharing Schemes for Almost All Access Structures
                  and Graphs},
  booktitle    = {Theory of Cryptography - 18th International Conference, {TCC} 2020,
                  Durham, NC, USA, November 16-19, 2020, Proceedings, Part {III}},
  series       = {Lecture Notes in Computer Science},
  volume       = {12552},
  pages        = {499--529},
  publisher    = {Springer},
  year         = {2020},
  url          = {https://doi.org/10.1007/978-3-030-64381-2\_18},
  doi          = {10.1007/978-3-030-64381-2\_18},
  timestamp    = {Sun, 12 Nov 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/tcc/BeimelF20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tcc/BeimelHNS20,
  author       = {Amos Beimel and
                  Iftach Haitner and
                  Kobbi Nissim and
                  Uri Stemmer},
  editor       = {Rafael Pass and
                  Krzysztof Pietrzak},
  title        = {On the Round Complexity of the Shuffle Model},
  booktitle    = {Theory of Cryptography - 18th International Conference, {TCC} 2020,
                  Durham, NC, USA, November 16-19, 2020, Proceedings, Part {II}},
  series       = {Lecture Notes in Computer Science},
  volume       = {12551},
  pages        = {683--712},
  publisher    = {Springer},
  year         = {2020},
  url          = {https://doi.org/10.1007/978-3-030-64378-2\_24},
  doi          = {10.1007/978-3-030-64378-2\_24},
  timestamp    = {Sat, 09 Apr 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/tcc/BeimelHNS20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2003-04509,
  author       = {Noga Alon and
                  Amos Beimel and
                  Shay Moran and
                  Uri Stemmer},
  title        = {Closure Properties for Private Classification and Online Prediction},
  journal      = {CoRR},
  volume       = {abs/2003.04509},
  year         = {2020},
  url          = {https://arxiv.org/abs/2003.04509},
  eprinttype    = {arXiv},
  eprint       = {2003.04509},
  timestamp    = {Tue, 17 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2003-04509.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2009-13510,
  author       = {Amos Beimel and
                  Iftach Haitner and
                  Kobbi Nissim and
                  Uri Stemmer},
  title        = {On the Round Complexity of the Shuffle Model},
  journal      = {CoRR},
  volume       = {abs/2009.13510},
  year         = {2020},
  url          = {https://arxiv.org/abs/2009.13510},
  eprinttype    = {arXiv},
  eprint       = {2009.13510},
  timestamp    = {Wed, 30 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2009-13510.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ApplebaumBNP20,
  author       = {Benny Applebaum and
                  Amos Beimel and
                  Oded Nir and
                  Naty Peter},
  title        = {Better Secret-Sharing via Robust Conditional Disclosure of Secrets},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR20-008}},
  year         = {2020},
  url          = {https://eccc.weizmann.ac.il/report/2020/008},
  eprinttype    = {ECCC},
  eprint       = {TR20-008},
  timestamp    = {Tue, 27 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/ApplebaumBNP20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/ApplebaumBNP20,
  author       = {Benny Applebaum and
                  Amos Beimel and
                  Oded Nir and
                  Naty Peter},
  title        = {Better Secret-Sharing via Robust Conditional Disclosure of Secrets},
  journal      = {{IACR} Cryptol. ePrint Arch.},
  pages        = {80},
  year         = {2020},
  url          = {https://eprint.iacr.org/2020/080},
  timestamp    = {Mon, 11 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/iacr/ApplebaumBNP20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/BeimelF20,
  author       = {Amos Beimel and
                  Oriol Farr{\`{a}}s},
  title        = {The Share Size of Secret-Sharing Schemes for Almost All Access Structures
                  and Graphs},
  journal      = {{IACR} Cryptol. ePrint Arch.},
  pages        = {664},
  year         = {2020},
  url          = {https://eprint.iacr.org/2020/664},
  timestamp    = {Tue, 30 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/iacr/BeimelF20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/BeimelHNS20,
  author       = {Amos Beimel and
                  Iftach Haitner and
                  Kobbi Nissim and
                  Uri Stemmer},
  title        = {On the Round Complexity of the Shuffle Model},
  journal      = {{IACR} Cryptol. ePrint Arch.},
  pages        = {1182},
  year         = {2020},
  url          = {https://eprint.iacr.org/2020/1182},
  timestamp    = {Fri, 30 Oct 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iacr/BeimelHNS20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jmlr/BeimelNS19,
  author       = {Amos Beimel and
                  Kobbi Nissim and
                  Uri Stemmer},
  title        = {Characterizing the Sample Complexity of Pure Private Learners},
  journal      = {J. Mach. Learn. Res.},
  volume       = {20},
  pages        = {146:1--146:33},
  year         = {2019},
  url          = {http://jmlr.org/papers/v20/18-269.html},
  timestamp    = {Thu, 18 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jmlr/BeimelNS19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BeimelNZ19,
  author       = {Amos Beimel and
                  Kobbi Nissim and
                  Mohammad Zaheri},
  editor       = {Dimitris Achlioptas and
                  L{\'{a}}szl{\'{o}} A. V{\'{e}}gh},
  title        = {Exploring Differential Obliviousness},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, {APPROX/RANDOM} 2019, September 20-22, 2019, Massachusetts
                  Institute of Technology, Cambridge, MA, {USA}},
  series       = {LIPIcs},
  volume       = {145},
  pages        = {65:1--65:20},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019},
  url          = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.65},
  doi          = {10.4230/LIPICS.APPROX-RANDOM.2019.65},
  timestamp    = {Tue, 21 Sep 2021 09:36:24 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/BeimelNZ19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/BeimelMNS19,
  author       = {Amos Beimel and
                  Shay Moran and
                  Kobbi Nissim and
                  Uri Stemmer},
  editor       = {Alina Beygelzimer and
                  Daniel Hsu},
  title        = {Private Center Points and Learning of Halfspaces},
  booktitle    = {Conference on Learning Theory, {COLT} 2019, 25-28 June 2019, Phoenix,
                  AZ, {USA}},
  series       = {Proceedings of Machine Learning Research},
  volume       = {99},
  pages        = {269--282},
  publisher    = {{PMLR}},
  year         = {2019},
  url          = {http://proceedings.mlr.press/v99/beimel19a.html},
  timestamp    = {Thu, 21 Jan 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/colt/BeimelMNS19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/eurocrypt/ApplebaumBFNP19,
  author       = {Benny Applebaum and
                  Amos Beimel and
                  Oriol Farr{\`{a}}s and
                  Oded Nir and
                  Naty Peter},
  editor       = {Yuval Ishai and
                  Vincent Rijmen},
  title        = {Secret-Sharing Schemes for General and Uniform Access Structures},
  booktitle    = {Advances in Cryptology - {EUROCRYPT} 2019 - 38th Annual International
                  Conference on the Theory and Applications of Cryptographic Techniques,
                  Darmstadt, Germany, May 19-23, 2019, Proceedings, Part {III}},
  series       = {Lecture Notes in Computer Science},
  volume       = {11478},
  pages        = {441--471},
  publisher    = {Springer},
  year         = {2019},
  url          = {https://doi.org/10.1007/978-3-030-17659-4\_15},
  doi          = {10.1007/978-3-030-17659-4\_15},
  timestamp    = {Mon, 15 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/eurocrypt/ApplebaumBFNP19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1902-10731,
  author       = {Amos Beimel and
                  Shay Moran and
                  Kobbi Nissim and
                  Uri Stemmer},
  title        = {Private Center Points and Learning of Halfspaces},
  journal      = {CoRR},
  volume       = {abs/1902.10731},
  year         = {2019},
  url          = {http://arxiv.org/abs/1902.10731},
  eprinttype    = {arXiv},
  eprint       = {1902.10731},
  timestamp    = {Tue, 21 May 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1902-10731.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1905-01373,
  author       = {Amos Beimel and
                  Kobbi Nissim and
                  Mohammad Zaheri},
  title        = {Exploring Differential Obliviousness},
  journal      = {CoRR},
  volume       = {abs/1905.01373},
  year         = {2019},
  url          = {http://arxiv.org/abs/1905.01373},
  eprinttype    = {arXiv},
  eprint       = {1905.01373},
  timestamp    = {Mon, 27 May 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1905-01373.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1912-08951,
  author       = {Amos Beimel and
                  Aleksandra Korolova and
                  Kobbi Nissim and
                  Or Sheffet and
                  Uri Stemmer},
  title        = {The power of synergy in differential privacy: Combining a small curator
                  with local randomizers},
  journal      = {CoRR},
  volume       = {abs/1912.08951},
  year         = {2019},
  url          = {http://arxiv.org/abs/1912.08951},
  eprinttype    = {arXiv},
  eprint       = {1912.08951},
  timestamp    = {Fri, 03 Jan 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1912-08951.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/ApplebaumBFNP19,
  author       = {Benny Applebaum and
                  Amos Beimel and
                  Oriol Farr{\`{a}}s and
                  Oded Nir and
                  Naty Peter},
  title        = {Secret-Sharing Schemes for General and Uniform Access Structures},
  journal      = {{IACR} Cryptol. ePrint Arch.},
  pages        = {231},
  year         = {2019},
  url          = {https://eprint.iacr.org/2019/231},
  timestamp    = {Mon, 11 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/iacr/ApplebaumBFNP19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/BeimelP19,
  author       = {Amos Beimel and
                  Naty Peter},
  title        = {Secret-Sharing from Robust Conditional Disclosure of Secrets},
  journal      = {{IACR} Cryptol. ePrint Arch.},
  pages        = {522},
  year         = {2019},
  url          = {https://eprint.iacr.org/2019/522},
  timestamp    = {Mon, 11 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/iacr/BeimelP19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/BeimelO19,
  author       = {Amos Beimel and
                  Hussien Othman},
  title        = {Evolving Ramp Secret Sharing with a Small Gap},
  journal      = {{IACR} Cryptol. ePrint Arch.},
  pages        = {1124},
  year         = {2019},
  url          = {https://eprint.iacr.org/2019/1124},
  timestamp    = {Mon, 11 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/iacr/BeimelO19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/asiacrypt/BeimelP18,
  author       = {Amos Beimel and
                  Naty Peter},
  editor       = {Thomas Peyrin and
                  Steven D. Galbraith},
  title        = {Optimal Linear Multiparty Conditional Disclosure of Secrets Protocols},
  booktitle    = {Advances in Cryptology - {ASIACRYPT} 2018 - 24th International Conference
                  on the Theory and Application of Cryptology and Information Security,
                  Brisbane, QLD, Australia, December 2-6, 2018, Proceedings, Part {III}},
  series       = {Lecture Notes in Computer Science},
  volume       = {11274},
  pages        = {332--362},
  publisher    = {Springer},
  year         = {2018},
  url          = {https://doi.org/10.1007/978-3-030-03332-3\_13},
  doi          = {10.1007/978-3-030-03332-3\_13},
  timestamp    = {Mon, 15 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/asiacrypt/BeimelP18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/eurocrypt/BeimelKN18,
  author       = {Amos Beimel and
                  Eyal Kushilevitz and
                  Pnina Nissim},
  editor       = {Jesper Buus Nielsen and
                  Vincent Rijmen},
  title        = {The Complexity of Multiparty {PSM} Protocols and Related Models},
  booktitle    = {Advances in Cryptology - {EUROCRYPT} 2018 - 37th Annual International
                  Conference on the Theory and Applications of Cryptographic Techniques,
                  Tel Aviv, Israel, April 29 - May 3, 2018 Proceedings, Part {II}},
  series       = {Lecture Notes in Computer Science},
  volume       = {10821},
  pages        = {287--318},
  publisher    = {Springer},
  year         = {2018},
  url          = {https://doi.org/10.1007/978-3-319-78375-8\_10},
  doi          = {10.1007/978-3-319-78375-8\_10},
  timestamp    = {Mon, 15 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/eurocrypt/BeimelKN18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BeimelHMO18,
  author       = {Amos Beimel and
                  Iftach Haitner and
                  Nikolaos Makriyannis and
                  Eran Omri},
  editor       = {Mikkel Thorup},
  title        = {Tighter Bounds on Multi-Party Coin Flipping via Augmented Weak Martingales
                  and Differentially Private Sampling},
  booktitle    = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
                  2018, Paris, France, October 7-9, 2018},
  pages        = {838--849},
  publisher    = {{IEEE} Computer Society},
  year         = {2018},
  url          = {https://doi.org/10.1109/FOCS.2018.00084},
  doi          = {10.1109/FOCS.2018.00084},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/BeimelHMO18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/scn/BeimelO18,
  author       = {Amos Beimel and
                  Hussien Othman},
  editor       = {Dario Catalano and
                  Roberto De Prisco},
  title        = {Evolving Ramp Secret-Sharing Schemes},
  booktitle    = {Security and Cryptography for Networks - 11th International Conference,
                  {SCN} 2018, Amalfi, Italy, September 5-7, 2018, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {11035},
  pages        = {313--332},
  publisher    = {Springer},
  year         = {2018},
  url          = {https://doi.org/10.1007/978-3-319-98113-0\_17},
  doi          = {10.1007/978-3-319-98113-0\_17},
  timestamp    = {Mon, 15 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/scn/BeimelO18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/tcc/2018-1,
  editor       = {Amos Beimel and
                  Stefan Dziembowski},
  title        = {Theory of Cryptography - 16th International Conference, {TCC} 2018,
                  Panaji, India, November 11-14, 2018, Proceedings, Part {I}},
  series       = {Lecture Notes in Computer Science},
  volume       = {11239},
  publisher    = {Springer},
  year         = {2018},
  url          = {https://doi.org/10.1007/978-3-030-03807-6},
  doi          = {10.1007/978-3-030-03807-6},
  isbn         = {978-3-030-03806-9},
  timestamp    = {Sat, 09 Apr 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/tcc/2018-1.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/tcc/2018-2,
  editor       = {Amos Beimel and
                  Stefan Dziembowski},
  title        = {Theory of Cryptography - 16th International Conference, {TCC} 2018,
                  Panaji, India, November 11-14, 2018, Proceedings, Part {II}},
  series       = {Lecture Notes in Computer Science},
  volume       = {11240},
  publisher    = {Springer},
  year         = {2018},
  url          = {https://doi.org/10.1007/978-3-030-03810-6},
  doi          = {10.1007/978-3-030-03810-6},
  isbn         = {978-3-030-03809-0},
  timestamp    = {Sat, 09 Apr 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/tcc/2018-2.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1810-13354,
  author       = {Amos Beimel and
                  Ronen I. Brafman},
  title        = {Privacy Preserving Multi-Agent Planning with Provable Guarantees},
  journal      = {CoRR},
  volume       = {abs/1810.13354},
  year         = {2018},
  url          = {http://arxiv.org/abs/1810.13354},
  eprinttype    = {arXiv},
  eprint       = {1810.13354},
  timestamp    = {Thu, 08 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1810-13354.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/BeimelKN18,
  author       = {Amos Beimel and
                  Eyal Kushilevitz and
                  Pnina Nissim},
  title        = {The Complexity of Multiparty {PSM} Protocols and Related Models},
  journal      = {{IACR} Cryptol. ePrint Arch.},
  pages        = {148},
  year         = {2018},
  url          = {http://eprint.iacr.org/2018/148},
  timestamp    = {Mon, 11 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/iacr/BeimelKN18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/BeimelP18,
  author       = {Amos Beimel and
                  Naty Peter},
  title        = {Optimal Linear Multiparty Conditional Disclosure of Secrets Protocols},
  journal      = {{IACR} Cryptol. ePrint Arch.},
  pages        = {441},
  year         = {2018},
  url          = {https://eprint.iacr.org/2018/441},
  timestamp    = {Mon, 11 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/iacr/BeimelP18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/eurocrypt/BeimelIK17,
  author       = {Amos Beimel and
                  Yuval Ishai and
                  Eyal Kushilevitz},
  editor       = {Jean{-}S{\'{e}}bastien Coron and
                  Jesper Buus Nielsen},
  title        = {Ad Hoc {PSM} Protocols: Secure Computation Without Coordination},
  booktitle    = {Advances in Cryptology - {EUROCRYPT} 2017 - 36th Annual International
                  Conference on the Theory and Applications of Cryptographic Techniques,
                  Paris, France, April 30 - May 4, 2017, Proceedings, Part {III}},
  series       = {Lecture Notes in Computer Science},
  volume       = {10212},
  pages        = {580--608},
  year         = {2017},
  url          = {https://doi.org/10.1007/978-3-319-56617-7\_20},
  doi          = {10.1007/978-3-319-56617-7\_20},
  timestamp    = {Tue, 14 May 2019 10:00:54 +0200},
  biburl       = {https://dblp.org/rec/conf/eurocrypt/BeimelIK17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tcc/BeimelFMP17,
  author       = {Amos Beimel and
                  Oriol Farr{\`{a}}s and
                  Yuval Mintz and
                  Naty Peter},
  editor       = {Yael Kalai and
                  Leonid Reyzin},
  title        = {Linear Secret-Sharing Schemes for Forbidden Graph Access Structures},
  booktitle    = {Theory of Cryptography - 15th International Conference, {TCC} 2017,
                  Baltimore, MD, USA, November 12-15, 2017, Proceedings, Part {II}},
  series       = {Lecture Notes in Computer Science},
  volume       = {10678},
  pages        = {394--423},
  publisher    = {Springer},
  year         = {2017},
  url          = {https://doi.org/10.1007/978-3-319-70503-3\_13},
  doi          = {10.1007/978-3-319-70503-3\_13},
  timestamp    = {Fri, 27 Dec 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/tcc/BeimelFMP17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BeimelHMO17,
  author       = {Amos Beimel and
                  Iftach Haitner and
                  Nikolaos Makriyannis and
                  Eran Omri},
  title        = {Tighter Bounds on Multi-Party Coin Flipping, via Augmented Weak Martingales
                  and Di erentially Private Sampling},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR17-168}},
  year         = {2017},
  url          = {https://eccc.weizmann.ac.il/report/2017/168},
  eprinttype    = {ECCC},
  eprint       = {TR17-168},
  timestamp    = {Tue, 27 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/BeimelHMO17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/BeimelIK17,
  author       = {Amos Beimel and
                  Yuval Ishai and
                  Eyal Kushilevitz},
  title        = {Ad Hoc {PSM} Protocols: Secure Computation Without Coordination},
  journal      = {{IACR} Cryptol. ePrint Arch.},
  pages        = {147},
  year         = {2017},
  url          = {http://eprint.iacr.org/2017/147},
  timestamp    = {Mon, 11 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/iacr/BeimelIK17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/BeimelFMP17,
  author       = {Amos Beimel and
                  Oriol Farr{\`{a}}s and
                  Yuval Mintz and
                  Naty Peter},
  title        = {Linear Secret-Sharing Schemes for Forbidden Graph Access Structures},
  journal      = {{IACR} Cryptol. ePrint Arch.},
  pages        = {940},
  year         = {2017},
  url          = {http://eprint.iacr.org/2017/940},
  timestamp    = {Mon, 11 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/iacr/BeimelFMP17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/joc/BeimelFM16,
  author       = {Amos Beimel and
                  Oriol Farr{\`{a}}s and
                  Yuval Mintz},
  title        = {Secret-Sharing Schemes for Very Dense Graphs},
  journal      = {J. Cryptol.},
  volume       = {29},
  number       = {2},
  pages        = {336--362},
  year         = {2016},
  url          = {https://doi.org/10.1007/s00145-014-9195-8},
  doi          = {10.1007/S00145-014-9195-8},
  timestamp    = {Fri, 18 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/joc/BeimelFM16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/BeimelNS16,
  author       = {Amos Beimel and
                  Kobbi Nissim and
                  Uri Stemmer},
  title        = {Private Learning and Sanitization: Pure vs. Approximate Differential
                  Privacy},
  journal      = {Theory Comput.},
  volume       = {12},
  number       = {1},
  pages        = {1--61},
  year         = {2016},
  url          = {https://doi.org/10.4086/toc.2016.v012a001},
  doi          = {10.4086/TOC.2016.V012A001},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/BeimelNS16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/BeimelGIK16,
  author       = {Amos Beimel and
                  Ariel Gabizon and
                  Yuval Ishai and
                  Eyal Kushilevitz},
  editor       = {Madhu Sudan},
  title        = {Distribution Design},
  booktitle    = {Proceedings of the 2016 {ACM} Conference on Innovations in Theoretical
                  Computer Science, Cambridge, MA, USA, January 14-16, 2016},
  pages        = {81--92},
  publisher    = {{ACM}},
  year         = {2016},
  url          = {https://doi.org/10.1145/2840728.2840759},
  doi          = {10.1145/2840728.2840759},
  timestamp    = {Tue, 14 Jun 2022 13:12:41 +0200},
  biburl       = {https://dblp.org/rec/conf/innovations/BeimelGIK16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/scn/BeimelFP16,
  author       = {Amos Beimel and
                  Oriol Farr{\`{a}}s and
                  Naty Peter},
  editor       = {Vassilis Zikas and
                  Roberto De Prisco},
  title        = {Secret Sharing Schemes for Dense Forbidden Graphs},
  booktitle    = {Security and Cryptography for Networks - 10th International Conference,
                  {SCN} 2016, Amalfi, Italy, August 31 - September 2, 2016, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {9841},
  pages        = {509--528},
  publisher    = {Springer},
  year         = {2016},
  url          = {https://doi.org/10.1007/978-3-319-44618-9\_27},
  doi          = {10.1007/978-3-319-44618-9\_27},
  timestamp    = {Thu, 23 Jun 2022 19:58:57 +0200},
  biburl       = {https://dblp.org/rec/conf/scn/BeimelFP16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/joc/BeimelOO15,
  author       = {Amos Beimel and
                  Eran Omri and
                  Ilan Orlov},
  title        = {Protocols for Multiparty Coin Toss with a Dishonest Majority},
  journal      = {J. Cryptol.},
  volume       = {28},
  number       = {3},
  pages        = {551--600},
  year         = {2015},
  url          = {https://doi.org/10.1007/s00145-013-9168-3},
  doi          = {10.1007/S00145-013-9168-3},
  timestamp    = {Mon, 26 Oct 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/joc/BeimelOO15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BeimelNS15,
  author       = {Amos Beimel and
                  Kobbi Nissim and
                  Uri Stemmer},
  editor       = {Piotr Indyk},
  title        = {Learning Privately with Labeled and Unlabeled Examples},
  booktitle    = {Proceedings of the Twenty-Sixth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2015, San Diego, CA, USA, January 4-6, 2015},
  pages        = {461--477},
  publisher    = {{SIAM}},
  year         = {2015},
  url          = {https://doi.org/10.1137/1.9781611973730.32},
  doi          = {10.1137/1.9781611973730.32},
  timestamp    = {Tue, 02 Feb 2021 17:07:30 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/BeimelNS15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tcc/AsharovBMO15,
  author       = {Gilad Asharov and
                  Amos Beimel and
                  Nikolaos Makriyannis and
                  Eran Omri},
  editor       = {Yevgeniy Dodis and
                  Jesper Buus Nielsen},
  title        = {Complete Characterization of Fairness in Secure Two-Party Computation
                  of Boolean Functions},
  booktitle    = {Theory of Cryptography - 12th Theory of Cryptography Conference, {TCC}
                  2015, Warsaw, Poland, March 23-25, 2015, Proceedings, Part {I}},
  series       = {Lecture Notes in Computer Science},
  volume       = {9014},
  pages        = {199--228},
  publisher    = {Springer},
  year         = {2015},
  url          = {https://doi.org/10.1007/978-3-662-46494-6\_10},
  doi          = {10.1007/978-3-662-46494-6\_10},
  timestamp    = {Sun, 25 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/tcc/AsharovBMO15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BeimelDKW14,
  author       = {Amos Beimel and
                  Sebastian Ben Daniel and
                  Eyal Kushilevitz and
                  Enav Weinreb},
  title        = {Choosing, Agreeing, and Eliminating in Communication Complexity},
  journal      = {Comput. Complex.},
  volume       = {23},
  number       = {1},
  pages        = {1--42},
  year         = {2014},
  url          = {https://doi.org/10.1007/s00037-013-0075-7},
  doi          = {10.1007/S00037-013-0075-7},
  timestamp    = {Sun, 15 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/BeimelDKW14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ml/BeimelBKN14,
  author       = {Amos Beimel and
                  Hai Brenner and
                  Shiva Prasad Kasiviswanathan and
                  Kobbi Nissim},
  title        = {Bounds on the sample complexity for private learning and private data
                  release},
  journal      = {Mach. Learn.},
  volume       = {94},
  number       = {3},
  pages        = {401--437},
  year         = {2014},
  url          = {https://doi.org/10.1007/s10994-013-5404-1},
  doi          = {10.1007/S10994-013-5404-1},
  timestamp    = {Mon, 02 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ml/BeimelBKN14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/crypto/BeimelGIKMP14,
  author       = {Amos Beimel and
                  Ariel Gabizon and
                  Yuval Ishai and
                  Eyal Kushilevitz and
                  Sigurd Meldgaard and
                  Anat Paskin{-}Cherniavsky},
  editor       = {Juan A. Garay and
                  Rosario Gennaro},
  title        = {Non-Interactive Secure Multiparty Computation},
  booktitle    = {Advances in Cryptology - {CRYPTO} 2014 - 34th Annual Cryptology Conference,
                  Santa Barbara, CA, USA, August 17-21, 2014, Proceedings, Part {II}},
  series       = {Lecture Notes in Computer Science},
  volume       = {8617},
  pages        = {387--404},
  publisher    = {Springer},
  year         = {2014},
  url          = {https://doi.org/10.1007/978-3-662-44381-1\_22},
  doi          = {10.1007/978-3-662-44381-1\_22},
  timestamp    = {Tue, 14 May 2019 10:00:48 +0200},
  biburl       = {https://dblp.org/rec/conf/crypto/BeimelGIKMP14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tcc/BeimelIKK14,
  author       = {Amos Beimel and
                  Yuval Ishai and
                  Ranjit Kumaresan and
                  Eyal Kushilevitz},
  editor       = {Yehuda Lindell},
  title        = {On the Cryptographic Complexity of the Worst Functions},
  booktitle    = {Theory of Cryptography - 11th Theory of Cryptography Conference, {TCC}
                  2014, San Diego, CA, USA, February 24-26, 2014. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {8349},
  pages        = {317--342},
  publisher    = {Springer},
  year         = {2014},
  url          = {https://doi.org/10.1007/978-3-642-54242-8\_14},
  doi          = {10.1007/978-3-642-54242-8\_14},
  timestamp    = {Tue, 14 May 2019 10:00:47 +0200},
  biburl       = {https://dblp.org/rec/conf/tcc/BeimelIKK14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tcc/BeimelBPT14,
  author       = {Amos Beimel and
                  Aner Ben{-}Efraim and
                  Carles Padr{\'{o}} and
                  Ilya Tyomkin},
  editor       = {Yehuda Lindell},
  title        = {Multi-linear Secret-Sharing Schemes},
  booktitle    = {Theory of Cryptography - 11th Theory of Cryptography Conference, {TCC}
                  2014, San Diego, CA, USA, February 24-26, 2014. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {8349},
  pages        = {394--418},
  publisher    = {Springer},
  year         = {2014},
  url          = {https://doi.org/10.1007/978-3-642-54242-8\_17},
  doi          = {10.1007/978-3-642-54242-8\_17},
  timestamp    = {Sat, 24 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/tcc/BeimelBPT14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BeimelNS14,
  author       = {Amos Beimel and
                  Kobbi Nissim and
                  Uri Stemmer},
  title        = {Characterizing the Sample Complexity of Private Learners},
  journal      = {CoRR},
  volume       = {abs/1402.2224},
  year         = {2014},
  url          = {http://arxiv.org/abs/1402.2224},
  eprinttype    = {arXiv},
  eprint       = {1402.2224},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BeimelNS14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BeimelNS14a,
  author       = {Amos Beimel and
                  Kobbi Nissim and
                  Uri Stemmer},
  title        = {Learning Privately with Labeled and Unlabeled Examples},
  journal      = {CoRR},
  volume       = {abs/1407.2662},
  year         = {2014},
  url          = {http://arxiv.org/abs/1407.2662},
  eprinttype    = {arXiv},
  eprint       = {1407.2662},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BeimelNS14a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BeimelNS14b,
  author       = {Amos Beimel and
                  Kobbi Nissim and
                  Uri Stemmer},
  title        = {Private Learning and Sanitization: Pure vs. Approximate Differential
                  Privacy},
  journal      = {CoRR},
  volume       = {abs/1407.2674},
  year         = {2014},
  url          = {http://arxiv.org/abs/1407.2674},
  eprinttype    = {arXiv},
  eprint       = {1407.2674},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BeimelNS14b.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/BeimelGIKMP14,
  author       = {Amos Beimel and
                  Ariel Gabizon and
                  Yuval Ishai and
                  Eyal Kushilevitz and
                  Sigurd Meldgaard and
                  Anat Paskin{-}Cherniavsky},
  title        = {Non-Interactive Secure Multiparty Computation},
  journal      = {{IACR} Cryptol. ePrint Arch.},
  pages        = {960},
  year         = {2014},
  url          = {http://eprint.iacr.org/2014/960},
  timestamp    = {Mon, 11 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/iacr/BeimelGIKMP14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/AsharovBMO14,
  author       = {Gilad Asharov and
                  Amos Beimel and
                  Nikolaos Makriyannis and
                  Eran Omri},
  title        = {Complete Characterization of Fairness in Secure Two-Party Computation
                  of Boolean Functions},
  journal      = {{IACR} Cryptol. ePrint Arch.},
  pages        = {1000},
  year         = {2014},
  url          = {http://eprint.iacr.org/2014/1000},
  timestamp    = {Mon, 11 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/iacr/AsharovBMO14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BeimelNS13,
  author       = {Amos Beimel and
                  Kobbi Nissim and
                  Uri Stemmer},
  editor       = {Prasad Raghavendra and
                  Sofya Raskhodnikova and
                  Klaus Jansen and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Private Learning and Sanitization: Pure vs. Approximate Differential
                  Privacy},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques - 16th International Workshop, {APPROX} 2013, and 17th
                  International Workshop, {RANDOM} 2013, Berkeley, CA, USA, August 21-23,
                  2013. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {8096},
  pages        = {363--378},
  publisher    = {Springer},
  year         = {2013},
  url          = {https://doi.org/10.1007/978-3-642-40328-6\_26},
  doi          = {10.1007/978-3-642-40328-6\_26},
  timestamp    = {Tue, 21 Sep 2021 09:36:24 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/BeimelNS13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/BeimelNS13,
  author       = {Amos Beimel and
                  Kobbi Nissim and
                  Uri Stemmer},
  editor       = {Robert D. Kleinberg},
  title        = {Characterizing the sample complexity of private learners},
  booktitle    = {Innovations in Theoretical Computer Science, {ITCS} '13, Berkeley,
                  CA, USA, January 9-12, 2013},
  pages        = {97--110},
  publisher    = {{ACM}},
  year         = {2013},
  url          = {https://doi.org/10.1145/2422436.2422450},
  doi          = {10.1145/2422436.2422450},
  timestamp    = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/innovations/BeimelNS13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BeimelCWZ12,
  author       = {Amos Beimel and
                  Yeow Meng Chee and
                  Huaxiong Wang and
                  Liang Feng Zhang},
  title        = {Communication-efficient distributed oblivious transfer},
  journal      = {J. Comput. Syst. Sci.},
  volume       = {78},
  number       = {4},
  pages        = {1142--1157},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.jcss.2012.02.002},
  doi          = {10.1016/J.JCSS.2012.02.002},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jcss/BeimelCWZ12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BeimelIKO12,
  author       = {Amos Beimel and
                  Yuval Ishai and
                  Eyal Kushilevitz and
                  Ilan Orlov},
  title        = {Share Conversion and Private Information Retrieval},
  booktitle    = {Proceedings of the 27th Conference on Computational Complexity, {CCC}
                  2012, Porto, Portugal, June 26-29, 2012},
  pages        = {258--268},
  publisher    = {{IEEE} Computer Society},
  year         = {2012},
  url          = {https://doi.org/10.1109/CCC.2012.23},
  doi          = {10.1109/CCC.2012.23},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/BeimelIKO12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/crypto/BeimelFM12,
  author       = {Amos Beimel and
                  Oriol Farr{\`{a}}s and
                  Yuval Mintz},
  editor       = {Reihaneh Safavi{-}Naini and
                  Ran Canetti},
  title        = {Secret Sharing Schemes for Very Dense Graphs},
  booktitle    = {Advances in Cryptology - {CRYPTO} 2012 - 32nd Annual Cryptology Conference,
                  Santa Barbara, CA, USA, August 19-23, 2012. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {7417},
  pages        = {144--161},
  publisher    = {Springer},
  year         = {2012},
  url          = {https://doi.org/10.1007/978-3-642-32009-5\_10},
  doi          = {10.1007/978-3-642-32009-5\_10},
  timestamp    = {Tue, 14 May 2019 10:00:48 +0200},
  biburl       = {https://dblp.org/rec/conf/crypto/BeimelFM12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/BeimelFM12,
  author       = {Amos Beimel and
                  Oriol Farr{\`{a}}s and
                  Yuval Mintz},
  title        = {Secret Sharing Schemes for Very Dense Graphs},
  journal      = {{IACR} Cryptol. ePrint Arch.},
  pages        = {404},
  year         = {2012},
  url          = {http://eprint.iacr.org/2012/404},
  timestamp    = {Mon, 11 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/iacr/BeimelFM12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/BeimelOO12,
  author       = {Amos Beimel and
                  Eran Omri and
                  Ilan Orlov},
  title        = {Protocols for Multiparty Coin Toss With Dishonest Majority},
  journal      = {{IACR} Cryptol. ePrint Arch.},
  pages        = {643},
  year         = {2012},
  url          = {http://eprint.iacr.org/2012/643},
  timestamp    = {Mon, 11 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/iacr/BeimelOO12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/BeimelO11,
  author       = {Amos Beimel and
                  Ilan Orlov},
  title        = {Secret Sharing and Non-Shannon Information Inequalities},
  journal      = {{IEEE} Trans. Inf. Theory},
  volume       = {57},
  number       = {9},
  pages        = {5634--5649},
  year         = {2011},
  url          = {https://doi.org/10.1109/TIT.2011.2162183},
  doi          = {10.1109/TIT.2011.2162183},
  timestamp    = {Tue, 10 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tit/BeimelO11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/codcry/Beimel11,
  author       = {Amos Beimel},
  editor       = {Yeow Meng Chee and
                  Zhenbo Guo and
                  San Ling and
                  Fengjing Shao and
                  Yuansheng Tang and
                  Huaxiong Wang and
                  Chaoping Xing},
  title        = {Secret-Sharing Schemes: {A} Survey},
  booktitle    = {Coding and Cryptology - Third International Workshop, {IWCC} 2011,
                  Qingdao, China, May 30-June 3, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6639},
  pages        = {11--46},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-20901-7\_2},
  doi          = {10.1007/978-3-642-20901-7\_2},
  timestamp    = {Tue, 14 May 2019 10:00:39 +0200},
  biburl       = {https://dblp.org/rec/conf/codcry/Beimel11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/crypto/BeimelLOO11,
  author       = {Amos Beimel and
                  Yehuda Lindell and
                  Eran Omri and
                  Ilan Orlov},
  editor       = {Phillip Rogaway},
  title        = {1/\emph{p}-Secure Multiparty Computation without Honest Majority and
                  the Best of Both Worlds},
  booktitle    = {Advances in Cryptology - {CRYPTO} 2011 - 31st Annual Cryptology Conference,
                  Santa Barbara, CA, USA, August 14-18, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6841},
  pages        = {277--296},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-22792-9\_16},
  doi          = {10.1007/978-3-642-22792-9\_16},
  timestamp    = {Sun, 25 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/crypto/BeimelLOO11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1103-2626,
  author       = {Amos Beimel and
                  Kobbi Nissim and
                  Eran Omri},
  title        = {Distributed Private Data Analysis: On Simultaneously Solving How and
                  What},
  journal      = {CoRR},
  volume       = {abs/1103.2626},
  year         = {2011},
  url          = {http://arxiv.org/abs/1103.2626},
  eprinttype    = {arXiv},
  eprint       = {1103.2626},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1103-2626.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/joc/BeimelMNW10,
  author       = {Amos Beimel and
                  Tal Malkin and
                  Kobbi Nissim and
                  Enav Weinreb},
  title        = {How Should We Solve Search Problems Privately?},
  journal      = {J. Cryptol.},
  volume       = {23},
  number       = {2},
  pages        = {344--371},
  year         = {2010},
  url          = {https://doi.org/10.1007/s00145-008-9032-z},
  doi          = {10.1007/S00145-008-9032-Z},
  timestamp    = {Fri, 18 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/joc/BeimelMNW10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/crypto/BeimelOO10,
  author       = {Amos Beimel and
                  Eran Omri and
                  Ilan Orlov},
  editor       = {Tal Rabin},
  title        = {Protocols for Multiparty Coin Toss with Dishonest Majority},
  booktitle    = {Advances in Cryptology - {CRYPTO} 2010, 30th Annual Cryptology Conference,
                  Santa Barbara, CA, USA, August 15-19, 2010. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6223},
  pages        = {538--557},
  publisher    = {Springer},
  year         = {2010},
  url          = {https://doi.org/10.1007/978-3-642-14623-7\_29},
  doi          = {10.1007/978-3-642-14623-7\_29},
  timestamp    = {Sun, 25 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/crypto/BeimelOO10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BeimelDKW10,
  author       = {Amos Beimel and
                  Sebastian Ben Daniel and
                  Eyal Kushilevitz and
                  Enav Weinreb},
  editor       = {Samson Abramsky and
                  Cyril Gavoille and
                  Claude Kirchner and
                  Friedhelm Meyer auf der Heide and
                  Paul G. Spirakis},
  title        = {Choosing, Agreeing, and Eliminating in Communication Complexity},
  booktitle    = {Automata, Languages and Programming, 37th International Colloquium,
                  {ICALP} 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part
                  {I}},
  series       = {Lecture Notes in Computer Science},
  volume       = {6198},
  pages        = {451--462},
  publisher    = {Springer},
  year         = {2010},
  url          = {https://doi.org/10.1007/978-3-642-14165-2\_39},
  doi          = {10.1007/978-3-642-14165-2\_39},
  timestamp    = {Tue, 14 May 2019 10:00:44 +0200},
  biburl       = {https://dblp.org/rec/conf/icalp/BeimelDKW10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tcc/BeimelKN10,
  author       = {Amos Beimel and
                  Shiva Prasad Kasiviswanathan and
                  Kobbi Nissim},
  editor       = {Daniele Micciancio},
  title        = {Bounds on the Sample Complexity for Private Learning and Private Data
                  Release},
  booktitle    = {Theory of Cryptography, 7th Theory of Cryptography Conference, {TCC}
                  2010, Zurich, Switzerland, February 9-11, 2010. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5978},
  pages        = {437--454},
  publisher    = {Springer},
  year         = {2010},
  url          = {https://doi.org/10.1007/978-3-642-11799-2\_26},
  doi          = {10.1007/978-3-642-11799-2\_26},
  timestamp    = {Tue, 14 May 2019 10:00:47 +0200},
  biburl       = {https://dblp.org/rec/conf/tcc/BeimelKN10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1011-5567,
  author       = {Amos Beimel and
                  Eran Omri and
                  Ilan Orlov},
  title        = {Secure Multiparty Computation with Partial Fairness},
  journal      = {CoRR},
  volume       = {abs/1011.5567},
  year         = {2010},
  url          = {http://arxiv.org/abs/1011.5567},
  eprinttype    = {arXiv},
  eprint       = {1011.5567},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1011-5567.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/BeimelOO10,
  author       = {Amos Beimel and
                  Eran Omri and
                  Ilan Orlov},
  title        = {Secure Multiparty Computation with Partial Fairness},
  journal      = {{IACR} Cryptol. ePrint Arch.},
  pages        = {599},
  year         = {2010},
  url          = {http://eprint.iacr.org/2010/599},
  timestamp    = {Mon, 11 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/iacr/BeimelOO10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ai/KarpasSB09,
  author       = {Erez Karpas and
                  Solomon Eyal Shimony and
                  Amos Beimel},
  title        = {Approximate belief updating in max-2-connected Bayes networks is NP-hard},
  journal      = {Artif. Intell.},
  volume       = {173},
  number       = {12-13},
  pages        = {1150--1153},
  year         = {2009},
  url          = {https://doi.org/10.1016/j.artint.2009.04.001},
  doi          = {10.1016/J.ARTINT.2009.04.001},
  timestamp    = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ai/KarpasSB09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BeimelHN09,
  author       = {Amos Beimel and
                  Renen Hallak and
                  Kobbi Nissim},
  title        = {Private Approximation of Clustering and Vertex Cover},
  journal      = {Comput. Complex.},
  volume       = {18},
  number       = {3},
  pages        = {435--494},
  year         = {2009},
  url          = {https://doi.org/10.1007/s00037-009-0259-3},
  doi          = {10.1007/S00037-009-0259-3},
  timestamp    = {Sun, 15 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/BeimelHN09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BeimelBBCCKO09,
  author       = {Amos Beimel and
                  Boaz Ben{-}Moshe and
                  Yehuda Ben{-}Shimol and
                  Paz Carmi and
                  Eldad Chai and
                  Itzik Kitroser and
                  Eran Omri},
  title        = {Matrix columns allocation problems},
  journal      = {Theor. Comput. Sci.},
  volume       = {410},
  number       = {21-23},
  pages        = {2174--2183},
  year         = {2009},
  url          = {https://doi.org/10.1016/j.tcs.2009.02.015},
  doi          = {10.1016/J.TCS.2009.02.015},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/BeimelBBCCKO09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tcc/BeimelO09,
  author       = {Amos Beimel and
                  Ilan Orlov},
  editor       = {Omer Reingold},
  title        = {Secret Sharing and Non-Shannon Information Inequalities},
  booktitle    = {Theory of Cryptography, 6th Theory of Cryptography Conference, {TCC}
                  2009, San Francisco, CA, USA, March 15-17, 2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5444},
  pages        = {539--557},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-00457-5\_32},
  doi          = {10.1007/978-3-642-00457-5\_32},
  timestamp    = {Tue, 14 May 2019 10:00:47 +0200},
  biburl       = {https://dblp.org/rec/conf/tcc/BeimelO09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BeimelCNW08,
  author       = {Amos Beimel and
                  Paz Carmi and
                  Kobbi Nissim and
                  Enav Weinreb},
  title        = {Private Approximation of Search Problems},
  journal      = {{SIAM} J. Comput.},
  volume       = {38},
  number       = {5},
  pages        = {1728--1760},
  year         = {2008},
  url          = {https://doi.org/10.1137/060671899},
  doi          = {10.1137/060671899},
  timestamp    = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamcomp/BeimelCNW08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BeimelTW08,
  author       = {Amos Beimel and
                  Tamir Tassa and
                  Enav Weinreb},
  title        = {Characterizing Ideal Weighted Threshold Secret Sharing},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {22},
  number       = {1},
  pages        = {360--397},
  year         = {2008},
  url          = {https://doi.org/10.1137/S0895480104445654},
  doi          = {10.1137/S0895480104445654},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/BeimelTW08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/BeimelL08,
  author       = {Amos Beimel and
                  Noam Livne},
  title        = {On Matroids and Nonideal Secret Sharing},
  journal      = {{IEEE} Trans. Inf. Theory},
  volume       = {54},
  number       = {6},
  pages        = {2626--2643},
  year         = {2008},
  url          = {https://doi.org/10.1109/TIT.2008.921708},
  doi          = {10.1109/TIT.2008.921708},
  timestamp    = {Tue, 10 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tit/BeimelL08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/crypto/BeimelNO08,
  author       = {Amos Beimel and
                  Kobbi Nissim and
                  Eran Omri},
  editor       = {David A. Wagner},
  title        = {Distributed Private Data Analysis: Simultaneously Solving How and
                  What},
  booktitle    = {Advances in Cryptology - {CRYPTO} 2008, 28th Annual International
                  Cryptology Conference, Santa Barbara, CA, USA, August 17-21, 2008.
                  Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5157},
  pages        = {451--468},
  publisher    = {Springer},
  year         = {2008},
  url          = {https://doi.org/10.1007/978-3-540-85174-5\_25},
  doi          = {10.1007/978-3-540-85174-5\_25},
  timestamp    = {Sun, 25 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/crypto/BeimelNO08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/scn/BeimelP08,
  author       = {Amos Beimel and
                  Anat Paskin},
  editor       = {Rafail Ostrovsky and
                  Roberto De Prisco and
                  Ivan Visconti},
  title        = {On Linear Secret Sharing for Connectivity in Directed Graphs},
  booktitle    = {Security and Cryptography for Networks, 6th International Conference,
                  {SCN} 2008, Amalfi, Italy, September 10-12, 2008. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5229},
  pages        = {172--184},
  publisher    = {Springer},
  year         = {2008},
  url          = {https://doi.org/10.1007/978-3-540-85855-3\_12},
  doi          = {10.1007/978-3-540-85855-3\_12},
  timestamp    = {Tue, 25 Feb 2020 11:33:46 +0100},
  biburl       = {https://dblp.org/rec/conf/scn/BeimelP08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tcc/BeimelLP08,
  author       = {Amos Beimel and
                  Noam Livne and
                  Carles Padr{\'{o}}},
  editor       = {Ran Canetti},
  title        = {Matroids Can Be Far from Ideal Secret Sharing},
  booktitle    = {Theory of Cryptography, Fifth Theory of Cryptography Conference, {TCC}
                  2008, New York, USA, March 19-21, 2008},
  series       = {Lecture Notes in Computer Science},
  volume       = {4948},
  pages        = {194--212},
  publisher    = {Springer},
  year         = {2008},
  url          = {https://doi.org/10.1007/978-3-540-78524-8\_12},
  doi          = {10.1007/978-3-540-78524-8\_12},
  timestamp    = {Tue, 14 May 2019 10:00:47 +0200},
  biburl       = {https://dblp.org/rec/conf/tcc/BeimelLP08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/BeimelBBKV08,
  author       = {Amos Beimel and
                  Francesco Bergadano and
                  Nader H. Bshouty and
                  Eyal Kushilevitz and
                  Stefano Varricchio},
  editor       = {Ming{-}Yang Kao},
  title        = {Learning Automata},
  booktitle    = {Encyclopedia of Algorithms - 2008 Edition},
  publisher    = {Springer},
  year         = {2008},
  url          = {https://doi.org/10.1007/978-0-387-30162-4\_194},
  doi          = {10.1007/978-0-387-30162-4\_194},
  timestamp    = {Thu, 27 Jun 2019 16:25:31 +0200},
  biburl       = {https://dblp.org/rec/reference/algo/BeimelBBKV08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dc/Beimel07,
  author       = {Amos Beimel},
  title        = {On private computation in incomplete networks},
  journal      = {Distributed Comput.},
  volume       = {19},
  number       = {3},
  pages        = {237--252},
  year         = {2007},
  url          = {https://doi.org/10.1007/s00446-006-0010-0},
  doi          = {10.1007/S00446-006-0010-0},
  timestamp    = {Fri, 13 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dc/Beimel07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/joc/BeimelS07,
  author       = {Amos Beimel and
                  Yoav Stahl},
  title        = {Robust Information-Theoretic Private Information Retrieval},
  journal      = {J. Cryptol.},
  volume       = {20},
  number       = {3},
  pages        = {295--321},
  year         = {2007},
  url          = {https://doi.org/10.1007/s00145-007-0424-2},
  doi          = {10.1007/S00145-007-0424-2},
  timestamp    = {Fri, 18 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/joc/BeimelS07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ton/BeimelDS07,
  author       = {Amos Beimel and
                  Shlomi Dolev and
                  Noam Singer},
  title        = {{RT} oblivious erasure correcting},
  journal      = {{IEEE/ACM} Trans. Netw.},
  volume       = {15},
  number       = {6},
  pages        = {1321--1332},
  year         = {2007},
  url          = {http://doi.acm.org/10.1145/1373476.1373485},
  doi          = {10.1145/1373476.1373485},
  timestamp    = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ton/BeimelDS07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/crypto/BeimelMNW07,
  author       = {Amos Beimel and
                  Tal Malkin and
                  Kobbi Nissim and
                  Enav Weinreb},
  editor       = {Alfred Menezes},
  title        = {How Should We Solve Search Problems Privately?},
  booktitle    = {Advances in Cryptology - {CRYPTO} 2007, 27th Annual International
                  Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2007,
                  Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {4622},
  pages        = {31--49},
  publisher    = {Springer},
  year         = {2007},
  url          = {https://doi.org/10.1007/978-3-540-74143-5\_3},
  doi          = {10.1007/978-3-540-74143-5\_3},
  timestamp    = {Tue, 14 May 2019 10:00:48 +0200},
  biburl       = {https://dblp.org/rec/conf/crypto/BeimelMNW07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tcc/BeimelF07,
  author       = {Amos Beimel and
                  Matthew K. Franklin},
  editor       = {Salil P. Vadhan},
  title        = {Weakly-Private Secret Sharing Schemes},
  booktitle    = {Theory of Cryptography, 4th Theory of Cryptography Conference, {TCC}
                  2007, Amsterdam, The Netherlands, February 21-24, 2007, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {4392},
  pages        = {253--272},
  publisher    = {Springer},
  year         = {2007},
  url          = {https://doi.org/10.1007/978-3-540-70936-7\_14},
  doi          = {10.1007/978-3-540-70936-7\_14},
  timestamp    = {Tue, 14 May 2019 10:00:47 +0200},
  biburl       = {https://dblp.org/rec/conf/tcc/BeimelF07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tcc/BeimelHN07,
  author       = {Amos Beimel and
                  Renen Hallak and
                  Kobbi Nissim},
  editor       = {Salil P. Vadhan},
  title        = {Private Approximation of Clustering and Vertex Cover},
  booktitle    = {Theory of Cryptography, 4th Theory of Cryptography Conference, {TCC}
                  2007, Amsterdam, The Netherlands, February 21-24, 2007, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {4392},
  pages        = {383--403},
  publisher    = {Springer},
  year         = {2007},
  url          = {https://doi.org/10.1007/978-3-540-70936-7\_21},
  doi          = {10.1007/978-3-540-70936-7\_21},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/tcc/BeimelHN07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BeimelW06,
  author       = {Amos Beimel and
                  Enav Weinreb},
  title        = {Monotone circuits for monotone weighted threshold functions},
  journal      = {Inf. Process. Lett.},
  volume       = {97},
  number       = {1},
  pages        = {12--18},
  year         = {2006},
  url          = {https://doi.org/10.1016/j.ipl.2005.09.008},
  doi          = {10.1016/J.IPL.2005.09.008},
  timestamp    = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ipl/BeimelW06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/scn/BeimelF06,
  author       = {Amos Beimel and
                  Matthew K. Franklin},
  editor       = {Roberto De Prisco and
                  Moti Yung},
  title        = {Edge Eavesdropping Games},
  booktitle    = {Security and Cryptography for Networks, 5th International Conference,
                  {SCN} 2006, Maiori, Italy, September 6-8, 2006, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {4116},
  pages        = {1--17},
  publisher    = {Springer},
  year         = {2006},
  url          = {https://doi.org/10.1007/11832072\_1},
  doi          = {10.1007/11832072\_1},
  timestamp    = {Tue, 14 May 2019 10:00:54 +0200},
  biburl       = {https://dblp.org/rec/conf/scn/BeimelF06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BeimelCNW06,
  author       = {Amos Beimel and
                  Paz Carmi and
                  Kobbi Nissim and
                  Enav Weinreb},
  editor       = {Jon M. Kleinberg},
  title        = {Private approximation of search problems},
  booktitle    = {Proceedings of the 38th Annual {ACM} Symposium on Theory of Computing,
                  Seattle, WA, USA, May 21-23, 2006},
  pages        = {119--128},
  publisher    = {{ACM}},
  year         = {2006},
  url          = {https://doi.org/10.1145/1132516.1132533},
  doi          = {10.1145/1132516.1132533},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/BeimelCNW06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tcc/BeimelL06,
  author       = {Amos Beimel and
                  Noam Livne},
  editor       = {Shai Halevi and
                  Tal Rabin},
  title        = {On Matroids and Non-ideal Secret Sharing},
  booktitle    = {Theory of Cryptography, Third Theory of Cryptography Conference, {TCC}
                  2006, New York, NY, USA, March 4-7, 2006, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3876},
  pages        = {482--501},
  publisher    = {Springer},
  year         = {2006},
  url          = {https://doi.org/10.1007/11681878\_25},
  doi          = {10.1007/11681878\_25},
  timestamp    = {Tue, 14 May 2019 10:00:47 +0200},
  biburl       = {https://dblp.org/rec/conf/tcc/BeimelL06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dc/BeimelM05,
  author       = {Amos Beimel and
                  Lior Malka},
  title        = {Efficient reliable communication over partially authenticated networks},
  journal      = {Distributed Comput.},
  volume       = {18},
  number       = {1},
  pages        = {1--19},
  year         = {2005},
  url          = {https://doi.org/10.1007/s00446-004-0119-y},
  doi          = {10.1007/S00446-004-0119-Y},
  timestamp    = {Fri, 13 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dc/BeimelM05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BeimelIK05,
  author       = {Amos Beimel and
                  Yuval Ishai and
                  Eyal Kushilevitz},
  title        = {General constructions for information-theoretic private information
                  retrieval},
  journal      = {J. Comput. Syst. Sci.},
  volume       = {71},
  number       = {2},
  pages        = {213--247},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.jcss.2005.03.002},
  doi          = {10.1016/J.JCSS.2005.03.002},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jcss/BeimelIK05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BeimelW05,
  author       = {Amos Beimel and
                  Enav Weinreb},
  title        = {Separating the Power of Monotone Span Programs over Different Fields},
  journal      = {{SIAM} J. Comput.},
  volume       = {34},
  number       = {5},
  pages        = {1196--1215},
  year         = {2005},
  url          = {https://doi.org/10.1137/S0097539704444038},
  doi          = {10.1137/S0097539704444038},
  timestamp    = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamcomp/BeimelW05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BeimelW05,
  author       = {Amos Beimel and
                  Enav Weinreb},
  title        = {Monotone Circuits for Weighted Threshold Functions},
  booktitle    = {20th Annual {IEEE} Conference on Computational Complexity {(CCC} 2005),
                  11-15 June 2005, San Jose, CA, {USA}},
  pages        = {67--75},
  publisher    = {{IEEE} Computer Society},
  year         = {2005},
  url          = {https://doi.org/10.1109/CCC.2005.12},
  doi          = {10.1109/CCC.2005.12},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/BeimelW05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sirocco/Beimel05,
  author       = {Amos Beimel},
  editor       = {Andrzej Pelc and
                  Michel Raynal},
  title        = {On Private Computation in Incomplete Networks},
  booktitle    = {Structural Information and Communication Complexity, 12th International
                  Colloquium, {SIROCCO} 2005, Mont Saint-Michel, France, May 24-26,
                  2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3499},
  pages        = {18--33},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/11429647\_4},
  doi          = {10.1007/11429647\_4},
  timestamp    = {Tue, 14 May 2019 10:00:55 +0200},
  biburl       = {https://dblp.org/rec/conf/sirocco/Beimel05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tcc/BeimelTW05,
  author       = {Amos Beimel and
                  Tamir Tassa and
                  Enav Weinreb},
  editor       = {Joe Kilian},
  title        = {Characterizing Ideal Weighted Threshold Secret Sharing},
  booktitle    = {Theory of Cryptography, Second Theory of Cryptography Conference,
                  {TCC} 2005, Cambridge, MA, USA, February 10-12, 2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3378},
  pages        = {600--619},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/978-3-540-30576-7\_32},
  doi          = {10.1007/978-3-540-30576-7\_32},
  timestamp    = {Sun, 02 Jun 2019 21:21:22 +0200},
  biburl       = {https://dblp.org/rec/conf/tcc/BeimelTW05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR05-141,
  author       = {Amos Beimel and
                  Paz Carmi and
                  Kobbi Nissim and
                  Enav Weinreb},
  title        = {Private Approximation of Search Problems},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR05-141}},
  year         = {2005},
  url          = {https://eccc.weizmann.ac.il/eccc-reports/2005/TR05-141/index.html},
  eprinttype    = {ECCC},
  eprint       = {TR05-141},
  timestamp    = {Wed, 28 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/ECCC-TR05-141.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/joc/BeimelIM04,
  author       = {Amos Beimel and
                  Yuval Ishai and
                  Tal Malkin},
  title        = {Reducing the Servers' Computation in Private Information Retrieval:
                  {PIR} with Preprocessing},
  journal      = {J. Cryptol.},
  volume       = {17},
  number       = {2},
  pages        = {125--151},
  year         = {2004},
  url          = {https://doi.org/10.1007/s00145-004-0134-y},
  doi          = {10.1007/S00145-004-0134-Y},
  timestamp    = {Fri, 18 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/joc/BeimelIM04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/itw/BeimelDS04,
  author       = {Amos Beimel and
                  Shlomi Dolev and
                  Noam Singer},
  title        = {{RT} oblivious erasure correcting},
  booktitle    = {2004 {IEEE} Information Theory Workshop, San Antonio, TX, USA, 24-29
                  October, 2004},
  pages        = {236--241},
  publisher    = {{IEEE}},
  year         = {2004},
  url          = {https://doi.org/10.1109/ITW.2004.1405306},
  doi          = {10.1109/ITW.2004.1405306},
  timestamp    = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/itw/BeimelDS04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/BeimelDS04,
  author       = {Amos Beimel and
                  Shlomi Dolev and
                  Noam Singer},
  editor       = {Soma Chaudhuri and
                  Shay Kutten},
  title        = {Brief announcement: {RT} oblivious erasure correcting},
  booktitle    = {Proceedings of the Twenty-Third Annual {ACM} Symposium on Principles
                  of Distributed Computing, {PODC} 2004, St. John's, Newfoundland, Canada,
                  July 25-28, 2004},
  pages        = {393},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1011767.1011856},
  doi          = {10.1145/1011767.1011856},
  timestamp    = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/podc/BeimelDS04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tcc/BeimelM04,
  author       = {Amos Beimel and
                  Tal Malkin},
  editor       = {Moni Naor},
  title        = {A Quantitative Approach to Reductions in Secure Computation},
  booktitle    = {Theory of Cryptography, First Theory of Cryptography Conference, {TCC}
                  2004, Cambridge, MA, USA, February 19-21, 2004, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {2951},
  pages        = {238--257},
  publisher    = {Springer},
  year         = {2004},
  url          = {https://doi.org/10.1007/978-3-540-24638-1\_14},
  doi          = {10.1007/978-3-540-24638-1\_14},
  timestamp    = {Tue, 14 May 2019 10:00:47 +0200},
  biburl       = {https://dblp.org/rec/conf/tcc/BeimelM04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/joc/BeimelD03,
  author       = {Amos Beimel and
                  Shlomi Dolev},
  title        = {Buses for Anonymous Message Delivery},
  journal      = {J. Cryptol.},
  volume       = {16},
  number       = {1},
  pages        = {25--39},
  year         = {2003},
  url          = {https://doi.org/10.1007/s00145-002-0128-6},
  doi          = {10.1007/S00145-002-0128-6},
  timestamp    = {Fri, 18 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/joc/BeimelD03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BeimelW03,
  author       = {Amos Beimel and
                  Enav Weinreb},
  title        = {Separating the Power of Monotone Span Programs over Different Fields},
  booktitle    = {44th Symposium on Foundations of Computer Science {(FOCS} 2003), 11-14
                  October 2003, Cambridge, MA, USA, Proceedings},
  pages        = {428--437},
  publisher    = {{IEEE} Computer Society},
  year         = {2003},
  url          = {https://doi.org/10.1109/SFCS.2003.1238216},
  doi          = {10.1109/SFCS.2003.1238216},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/BeimelW03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/BeimelM03,
  author       = {Amos Beimel and
                  Lior Malka},
  editor       = {Elizabeth Borowsky and
                  Sergio Rajsbaum},
  title        = {Efficient reliable communication over partially authenticated networks},
  booktitle    = {Proceedings of the Twenty-Second {ACM} Symposium on Principles of
                  Distributed Computing, {PODC} 2003, Boston, Massachusetts, USA, July
                  13-16, 2003},
  pages        = {233--242},
  publisher    = {{ACM}},
  year         = {2003},
  url          = {https://doi.org/10.1145/872035.872070},
  doi          = {10.1145/872035.872070},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/podc/BeimelM03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR03-086,
  author       = {Amos Beimel and
                  Tal Malkin},
  title        = {A Quantitative Approach to Reductions in Secure Computation},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR03-086}},
  year         = {2003},
  url          = {https://eccc.weizmann.ac.il/eccc-reports/2003/TR03-086/index.html},
  eprinttype    = {ECCC},
  eprint       = {TR03-086},
  timestamp    = {Wed, 28 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/ECCC-TR03-086.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BeimelIKR02,
  author       = {Amos Beimel and
                  Yuval Ishai and
                  Eyal Kushilevitz and
                  Jean{-}Fran{\c{c}}ois Raymond},
  title        = {Breaking the O(n1/(2k-1)) Barrier for Information-Theoretic Private
                  Information Retrieval},
  booktitle    = {43rd Symposium on Foundations of Computer Science {(FOCS} 2002), 16-19
                  November 2002, Vancouver, BC, Canada, Proceedings},
  pages        = {261--270},
  publisher    = {{IEEE} Computer Society},
  year         = {2002},
  url          = {https://doi.org/10.1109/SFCS.2002.1181949},
  doi          = {10.1109/SFCS.2002.1181949},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/BeimelIKR02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/scn/BeimelS02,
  author       = {Amos Beimel and
                  Yoav Stahl},
  editor       = {Stelvio Cimato and
                  Clemente Galdi and
                  Giuseppe Persiano},
  title        = {Robust Information-Theoretic Private Information Retrieval},
  booktitle    = {Security in Communication Networks, Third International Conference,
                  {SCN} 2002, Amalfi, Italy, September 11-13, 2002. Revised Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {2576},
  pages        = {326--341},
  publisher    = {Springer},
  year         = {2002},
  url          = {https://doi.org/10.1007/3-540-36413-7\_24},
  doi          = {10.1007/3-540-36413-7\_24},
  timestamp    = {Tue, 14 May 2019 10:00:54 +0200},
  biburl       = {https://dblp.org/rec/conf/scn/BeimelS02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/BeimelGK01,
  author       = {Amos Beimel and
                  Felix Geller and
                  Eyal Kushilevitz},
  title        = {The Query Complexity of Finding Local Minima in the Lattice},
  journal      = {Inf. Comput.},
  volume       = {171},
  number       = {1},
  pages        = {69--83},
  year         = {2001},
  url          = {https://doi.org/10.1006/inco.2001.3065},
  doi          = {10.1006/INCO.2001.3065},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/BeimelGK01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BeimelI01,
  author       = {Amos Beimel and
                  Yuval Ishai},
  title        = {On the Power of Nonlinear Secrect-Sharing},
  booktitle    = {Proceedings of the 16th Annual {IEEE} Conference on Computational
                  Complexity, Chicago, Illinois, USA, June 18-21, 2001},
  pages        = {188--202},
  publisher    = {{IEEE} Computer Society},
  year         = {2001},
  url          = {https://doi.org/10.1109/CCC.2001.933886},
  doi          = {10.1109/CCC.2001.933886},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/BeimelI01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BeimelI01,
  author       = {Amos Beimel and
                  Yuval Ishai},
  editor       = {Fernando Orejas and
                  Paul G. Spirakis and
                  Jan van Leeuwen},
  title        = {Information-Theoretic Private Information Retrieval: {A} Unified Construction},
  booktitle    = {Automata, Languages and Programming, 28th International Colloquium,
                  {ICALP} 2001, Crete, Greece, July 8-12, 2001, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {2076},
  pages        = {912--926},
  publisher    = {Springer},
  year         = {2001},
  url          = {https://doi.org/10.1007/3-540-48224-5\_74},
  doi          = {10.1007/3-540-48224-5\_74},
  timestamp    = {Tue, 14 May 2019 10:00:44 +0200},
  biburl       = {https://dblp.org/rec/conf/icalp/BeimelI01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR01-015,
  author       = {Amos Beimel and
                  Yuval Ishai},
  title        = {Information-Theoretic Private Information Retrieval: {A} Unified Construction},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR01-015}},
  year         = {2001},
  url          = {https://eccc.weizmann.ac.il/eccc-reports/2001/TR01-015/index.html},
  eprinttype    = {ECCC},
  eprint       = {TR01-015},
  timestamp    = {Wed, 28 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/ECCC-TR01-015.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/BeimelI01,
  author       = {Amos Beimel and
                  Yuval Ishai},
  title        = {On the Power of Nonlinear Secret-Sharing},
  journal      = {{IACR} Cryptol. ePrint Arch.},
  pages        = {30},
  year         = {2001},
  url          = {http://eprint.iacr.org/2001/030},
  timestamp    = {Mon, 11 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/iacr/BeimelI01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BeimelK00,
  author       = {Amos Beimel and
                  Eyal Kushilevitz},
  title        = {Learning unions of high-dimensional boxes over the reals},
  journal      = {Inf. Process. Lett.},
  volume       = {73},
  number       = {5-6},
  pages        = {213--220},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0020-0190(00)00024-7},
  doi          = {10.1016/S0020-0190(00)00024-7},
  timestamp    = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ipl/BeimelK00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BeimelBBKV00,
  author       = {Amos Beimel and
                  Francesco Bergadano and
                  Nader H. Bshouty and
                  Eyal Kushilevitz and
                  Stefano Varricchio},
  title        = {Learning functions represented as multiplicity automata},
  journal      = {J. {ACM}},
  volume       = {47},
  number       = {3},
  pages        = {506--530},
  year         = {2000},
  url          = {https://doi.org/10.1145/337244.337257},
  doi          = {10.1145/337244.337257},
  timestamp    = {Wed, 25 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jacm/BeimelBBKV00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BeimelBDK00,
  author       = {Amos Beimel and
                  Mike Burmester and
                  Yvo Desmedt and
                  Eyal Kushilevitz},
  title        = {Computing Functions of a Shared Secret},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {13},
  number       = {3},
  pages        = {324--345},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0895480195288819},
  doi          = {10.1137/S0895480195288819},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/BeimelBDK00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/crypto/BeimelIM00,
  author       = {Amos Beimel and
                  Yuval Ishai and
                  Tal Malkin},
  editor       = {Mihir Bellare},
  title        = {Reducing the Servers Computation in Private Information Retrieval:
                  {PIR} with Preprocessing},
  booktitle    = {Advances in Cryptology - {CRYPTO} 2000, 20th Annual International
                  Cryptology Conference, Santa Barbara, California, USA, August 20-24,
                  2000, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1880},
  pages        = {55--73},
  publisher    = {Springer},
  year         = {2000},
  url          = {https://doi.org/10.1007/3-540-44598-6\_4},
  doi          = {10.1007/3-540-44598-6\_4},
  timestamp    = {Tue, 14 May 2019 10:00:48 +0200},
  biburl       = {https://dblp.org/rec/conf/crypto/BeimelIM00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BeimelG99,
  author       = {Amos Beimel and
                  Anna G{\'{a}}l},
  title        = {On Arithmetic Branching Programs},
  journal      = {J. Comput. Syst. Sci.},
  volume       = {59},
  number       = {2},
  pages        = {195--220},
  year         = {1999},
  url          = {https://doi.org/10.1006/jcss.1999.1648},
  doi          = {10.1006/JCSS.1999.1648},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jcss/BeimelG99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BeimelF99,
  author       = {Amos Beimel and
                  Matthew K. Franklin},
  title        = {Reliable Communication over Partially Authenticated Networks},
  journal      = {Theor. Comput. Sci.},
  volume       = {220},
  number       = {1},
  pages        = {185--210},
  year         = {1999},
  url          = {https://doi.org/10.1016/S0304-3975(98)00241-2},
  doi          = {10.1016/S0304-3975(98)00241-2},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/BeimelF99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/crypto/BeimelMM99,
  author       = {Amos Beimel and
                  Tal Malkin and
                  Silvio Micali},
  editor       = {Michael J. Wiener},
  title        = {The All-or-Nothing Nature of Two-Party Secure Computation},
  booktitle    = {Advances in Cryptology - {CRYPTO} '99, 19th Annual International Cryptology
                  Conference, Santa Barbara, California, USA, August 15-19, 1999, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1666},
  pages        = {80--97},
  publisher    = {Springer},
  year         = {1999},
  url          = {https://doi.org/10.1007/3-540-48405-1\_6},
  doi          = {10.1007/3-540-48405-1\_6},
  timestamp    = {Tue, 14 May 2019 10:00:48 +0200},
  biburl       = {https://dblp.org/rec/conf/crypto/BeimelMM99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BeimelIKM99,
  author       = {Amos Beimel and
                  Yuval Ishai and
                  Eyal Kushilevitz and
                  Tal Malkin},
  editor       = {Jeffrey Scott Vitter and
                  Lawrence L. Larmore and
                  Frank Thomson Leighton},
  title        = {One-Way Functions Are Essential for Single-Server Private Information
                  Retrieval},
  booktitle    = {Proceedings of the Thirty-First Annual {ACM} Symposium on Theory of
                  Computing, May 1-4, 1999, Atlanta, Georgia, {USA}},
  pages        = {89--98},
  publisher    = {{ACM}},
  year         = {1999},
  url          = {https://doi.org/10.1145/301250.301277},
  doi          = {10.1145/301250.301277},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/BeimelIKM99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BeimelK98,
  author       = {Amos Beimel and
                  Eyal Kushilevitz},
  title        = {Learning Boxes in High Dimension},
  journal      = {Algorithmica},
  volume       = {22},
  number       = {1/2},
  pages        = {76--90},
  year         = {1998},
  url          = {https://doi.org/10.1007/PL00013835},
  doi          = {10.1007/PL00013835},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/BeimelK98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/BeimelC98,
  author       = {Amos Beimel and
                  Benny Chor},
  title        = {Secret Sharing with Public Reconstruction},
  journal      = {{IEEE} Trans. Inf. Theory},
  volume       = {44},
  number       = {5},
  pages        = {1887--1896},
  year         = {1998},
  url          = {https://doi.org/10.1109/TIT.1998.705566},
  doi          = {10.1109/TIT.1998.705566},
  timestamp    = {Tue, 10 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tit/BeimelC98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BeimelG98,
  author       = {Amos Beimel and
                  Anna G{\'{a}}l},
  title        = {On Arithmetic Branching Programs},
  booktitle    = {Proceedings of the 13th Annual {IEEE} Conference on Computational
                  Complexity, Buffalo, New York, USA, June 15-18, 1998},
  pages        = {68--80},
  publisher    = {{IEEE} Computer Society},
  year         = {1998},
  url          = {https://doi.org/10.1109/CCC.1998.694592},
  doi          = {10.1109/CCC.1998.694592},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/BeimelG98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/BeimelGK98,
  author       = {Amos Beimel and
                  Felix Geller and
                  Eyal Kushilevitz},
  editor       = {Peter L. Bartlett and
                  Yishay Mansour},
  title        = {The Query Complexity of Finding Local Minima in the Lattice},
  booktitle    = {Proceedings of the Eleventh Annual Conference on Computational Learning
                  Theory, {COLT} 1998, Madison, Wisconsin, USA, July 24-26, 1998},
  pages        = {294--302},
  publisher    = {{ACM}},
  year         = {1998},
  url          = {https://doi.org/10.1145/279943.280000},
  doi          = {10.1145/279943.280000},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/colt/BeimelGK98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BeimelGP97,
  author       = {Amos Beimel and
                  Anna G{\'{a}}l and
                  Mike Paterson},
  title        = {Lower Bounds for Monotone Span Programs},
  journal      = {Comput. Complex.},
  volume       = {6},
  number       = {1},
  pages        = {29--45},
  year         = {1997},
  url          = {https://doi.org/10.1007/BF01202040},
  doi          = {10.1007/BF01202040},
  timestamp    = {Sun, 15 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/BeimelGP97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/eurocolt/BeimelK97,
  author       = {Amos Beimel and
                  Eyal Kushilevitz},
  editor       = {Shai Ben{-}David},
  title        = {Learning Boxes in High Dimension},
  booktitle    = {Computational Learning Theory, Third European Conference, EuroCOLT
                  '97, Jerusalem, Israel, March 17-19, 1997, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1208},
  pages        = {3--15},
  publisher    = {Springer},
  year         = {1997},
  url          = {https://doi.org/10.1007/3-540-62685-9\_2},
  doi          = {10.1007/3-540-62685-9\_2},
  timestamp    = {Tue, 14 May 2019 10:00:53 +0200},
  biburl       = {https://dblp.org/rec/conf/eurocolt/BeimelK97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/BeimelF97,
  author       = {Amos Beimel and
                  Matthew K. Franklin},
  editor       = {Marios Mavronicolas and
                  Philippas Tsigas},
  title        = {Reliable Communication over Partially Authenticated Networks},
  booktitle    = {Distributed Algorithms, 11th International Workshop, {WDAG} '97, Saarbr{\"{u}}cken,
                  Germany, September 24-26, 1997, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1320},
  pages        = {245--259},
  publisher    = {Springer},
  year         = {1997},
  url          = {https://doi.org/10.1007/BFb0030688},
  doi          = {10.1007/BFB0030688},
  timestamp    = {Tue, 14 May 2019 10:00:54 +0200},
  biburl       = {https://dblp.org/rec/conf/wdag/BeimelF97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/il/Beimel96,
  author       = {Amos Beimel},
  title        = {Secure schemes for secret sharing and key distribution},
  school       = {Technion - Israel Institute of Technology, Israel},
  year         = {1996},
  url          = {https://technion.primo.exlibrisgroup.com/permalink/972TEC\_INST/q1jq5o/alma990021768270203971},
  timestamp    = {Thu, 01 Dec 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/phd/il/Beimel96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/BeimelC96,
  author       = {Amos Beimel and
                  Benny Chor},
  title        = {Communication in key distribution schemes},
  journal      = {{IEEE} Trans. Inf. Theory},
  volume       = {42},
  number       = {1},
  pages        = {19--28},
  year         = {1996},
  url          = {https://doi.org/10.1109/18.481774},
  doi          = {10.1109/18.481774},
  timestamp    = {Tue, 10 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tit/BeimelC96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BeimelBBKV96,
  author       = {Amos Beimel and
                  Francesco Bergadano and
                  Nader H. Bshouty and
                  Eyal Kushilevitz and
                  Stefano Varricchio},
  title        = {On the Applications of Multiplicity Automata in Learning},
  booktitle    = {37th Annual Symposium on Foundations of Computer Science, {FOCS} '96,
                  Burlington, Vermont, USA, 14-16 October, 1996},
  pages        = {349--358},
  publisher    = {{IEEE} Computer Society},
  year         = {1996},
  url          = {https://doi.org/10.1109/SFCS.1996.548494},
  doi          = {10.1109/SFCS.1996.548494},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/BeimelBBKV96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/crypto/BeimelC95,
  author       = {Amos Beimel and
                  Benny Chor},
  editor       = {Don Coppersmith},
  title        = {Secret Sharing with Public Reconstruction (Extended Abstract)},
  booktitle    = {Advances in Cryptology - {CRYPTO} '95, 15th Annual International Cryptology
                  Conference, Santa Barbara, California, USA, August 27-31, 1995, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {963},
  pages        = {353--366},
  publisher    = {Springer},
  year         = {1995},
  url          = {https://doi.org/10.1007/3-540-44750-4\_28},
  doi          = {10.1007/3-540-44750-4\_28},
  timestamp    = {Tue, 14 May 2019 10:00:48 +0200},
  biburl       = {https://dblp.org/rec/conf/crypto/BeimelC95.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BeimelGP95,
  author       = {Amos Beimel and
                  Anna G{\'{a}}l and
                  Mike Paterson},
  title        = {Lower Bounds for Monotone Span Programs},
  booktitle    = {36th Annual Symposium on Foundations of Computer Science, Milwaukee,
                  Wisconsin, USA, 23-25 October 1995},
  pages        = {674--681},
  publisher    = {{IEEE} Computer Society},
  year         = {1995},
  url          = {https://doi.org/10.1109/SFCS.1995.492669},
  doi          = {10.1109/SFCS.1995.492669},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/BeimelGP95.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR95-001,
  author       = {Amos Beimel and
                  Anna G{\'{a}}l and
                  Mike Paterson},
  title        = {Lower Bounds for Monotone Span Programs},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR95-001}},
  year         = {1995},
  url          = {https://eccc.weizmann.ac.il/eccc-reports/1995/TR95-001/index.html},
  eprinttype    = {ECCC},
  eprint       = {TR95-001},
  timestamp    = {Wed, 28 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/ECCC-TR95-001.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/BeimelC94,
  author       = {Amos Beimel and
                  Benny Chor},
  title        = {Universally ideal secret-sharing schemes},
  journal      = {{IEEE} Trans. Inf. Theory},
  volume       = {40},
  number       = {3},
  pages        = {786--794},
  year         = {1994},
  url          = {https://doi.org/10.1109/18.335890},
  doi          = {10.1109/18.335890},
  timestamp    = {Tue, 10 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tit/BeimelC94.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/crypto/BeimelC93,
  author       = {Amos Beimel and
                  Benny Chor},
  editor       = {Douglas R. Stinson},
  title        = {Interaction in Key Distribution Schemes (Extended Abstract)},
  booktitle    = {Advances in Cryptology - {CRYPTO} '93, 13th Annual International Cryptology
                  Conference, Santa Barbara, California, USA, August 22-26, 1993, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {773},
  pages        = {444--455},
  publisher    = {Springer},
  year         = {1993},
  url          = {https://doi.org/10.1007/3-540-48329-2\_38},
  doi          = {10.1007/3-540-48329-2\_38},
  timestamp    = {Tue, 14 May 2019 10:00:48 +0200},
  biburl       = {https://dblp.org/rec/conf/crypto/BeimelC93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/crypto/BeimelC92,
  author       = {Amos Beimel and
                  Benny Chor},
  editor       = {Ernest F. Brickell},
  title        = {Universally Ideal Secret Sharing Schemes (Preliminary Version)},
  booktitle    = {Advances in Cryptology - {CRYPTO} '92, 12th Annual International Cryptology
                  Conference, Santa Barbara, California, USA, August 16-20, 1992, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {740},
  pages        = {183--195},
  publisher    = {Springer},
  year         = {1992},
  url          = {https://doi.org/10.1007/3-540-48071-4\_13},
  doi          = {10.1007/3-540-48071-4\_13},
  timestamp    = {Tue, 01 Jun 2021 15:21:29 +0200},
  biburl       = {https://dblp.org/rec/conf/crypto/BeimelC92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics