Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Ido Shahaf
@article{DBLP:journals/joc/RosenSS21,
author = {Alon Rosen and
Gil Segev and
Ido Shahaf},
title = {Can {PPAD} Hardness be Based on Standard Cryptographic Assumptions?},
journal = {J. Cryptol.},
volume = {34},
number = {1},
pages = {8},
year = {2021},
url = {https://doi.org/10.1007/s00145-020-09369-6},
doi = {10.1007/S00145-020-09369-6},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/joc/RosenSS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/joc/AsharovSS21,
author = {Gilad Asharov and
Gil Segev and
Ido Shahaf},
title = {Tight Tradeoffs in Searchable Symmetric Encryption},
journal = {J. Cryptol.},
volume = {34},
number = {2},
pages = {9},
year = {2021},
url = {https://doi.org/10.1007/s00145-020-09370-z},
doi = {10.1007/S00145-020-09370-Z},
timestamp = {Tue, 02 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/joc/AsharovSS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AsharovN0S21,
author = {Gilad Asharov and
Moni Naor and
Gil Segev and
Ido Shahaf},
title = {Searchable Symmetric Encryption: Optimal Locality in Linear Space
via Two-Dimensional Balanced Allocations},
journal = {{SIAM} J. Comput.},
volume = {50},
number = {5},
pages = {1501--1536},
year = {2021},
url = {https://doi.org/10.1137/19M1303186},
doi = {10.1137/19M1303186},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AsharovN0S21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/eurocrypt/Rotem0S20,
author = {Lior Rotem and
Gil Segev and
Ido Shahaf},
editor = {Anne Canteaut and
Yuval Ishai},
title = {Generic-Group Delay Functions Require Hidden-Order Groups},
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 {III}},
series = {Lecture Notes in Computer Science},
volume = {12107},
pages = {155--180},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-45727-3\_6},
doi = {10.1007/978-3-030-45727-3\_6},
timestamp = {Mon, 04 May 2020 14:40:23 +0200},
biburl = {https://dblp.org/rec/conf/eurocrypt/Rotem0S20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icits/0001S20,
author = {Gil Segev and
Ido Shahaf},
editor = {Yael Tauman Kalai and
Adam D. Smith and
Daniel Wichs},
title = {Hardness vs. (Very Little) Structure in Cryptography: {A} Multi-Prover
Interactive Proofs Perspective},
booktitle = {1st Conference on Information-Theoretic Cryptography, {ITC} 2020,
June 17-19, 2020, Boston, MA, {USA}},
series = {LIPIcs},
volume = {163},
pages = {10:1--10:23},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ITC.2020.10},
doi = {10.4230/LIPICS.ITC.2020.10},
timestamp = {Thu, 04 Jun 2020 17:19:53 +0200},
biburl = {https://dblp.org/rec/conf/icits/0001S20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/ShahafO020,
author = {Ido Shahaf and
Or Ordentlich and
Gil Segev},
title = {An Information-Theoretic Proof of the Streaming Switching Lemma for
Symmetric Encryption},
booktitle = {{IEEE} International Symposium on Information Theory, {ISIT} 2020,
Los Angeles, CA, USA, June 21-26, 2020},
pages = {858--863},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/ISIT44484.2020.9174331},
doi = {10.1109/ISIT44484.2020.9174331},
timestamp = {Tue, 15 Sep 2020 10:18:53 +0200},
biburl = {https://dblp.org/rec/conf/isit/ShahafO020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2004-09935,
author = {Ido Shahaf and
Or Ordentlich and
Gil Segev},
title = {An Information-Theoretic Proof of the Streaming Switching Lemma for
Symmetric Encryption},
journal = {CoRR},
volume = {abs/2004.09935},
year = {2020},
url = {https://arxiv.org/abs/2004.09935},
eprinttype = {arXiv},
eprint = {2004.09935},
timestamp = {Tue, 28 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2004-09935.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/RotemSS20,
author = {Lior Rotem and
Gil Segev and
Ido Shahaf},
title = {Generic-Group Delay Functions Require Hidden-Order Groups},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {225},
year = {2020},
url = {https://eprint.iacr.org/2020/225},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/RotemSS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/SegevS20,
author = {Gil Segev and
Ido Shahaf},
title = {Hardness vs. (Very Little) Structure in Cryptography: {A} Multi-Prover
Interactive Proofs Perspective},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {330},
year = {2020},
url = {https://eprint.iacr.org/2020/330},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/SegevS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/ShahafOS20,
author = {Ido Shahaf and
Or Ordentlich and
Gil Segev},
title = {An Information-Theoretic Proof of the Streaming Switching Lemma for
Symmetric Encryption},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {462},
year = {2020},
url = {https://eprint.iacr.org/2020/462},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/ShahafOS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/crypto/AsharovSS18,
author = {Gilad Asharov and
Gil Segev and
Ido Shahaf},
editor = {Hovav Shacham and
Alexandra Boldyreva},
title = {Tight Tradeoffs in Searchable Symmetric Encryption},
booktitle = {Advances in Cryptology - {CRYPTO} 2018 - 38th Annual International
Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2018,
Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {10991},
pages = {407--436},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-96884-1\_14},
doi = {10.1007/978-3-319-96884-1\_14},
timestamp = {Sun, 16 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/crypto/AsharovSS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tcc/SegevS18,
author = {Gil Segev and
Ido Shahaf},
editor = {Amos Beimel and
Stefan Dziembowski},
title = {Ciphertext Expansion in Limited-Leakage Order-Preserving Encryption:
{A} Tight Computational Lower Bound},
booktitle = {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},
pages = {177--191},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-03810-6\_7},
doi = {10.1007/978-3-030-03810-6\_7},
timestamp = {Sat, 09 Apr 2022 12:44:08 +0200},
biburl = {https://dblp.org/rec/conf/tcc/SegevS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/AsharovSS18,
author = {Gilad Asharov and
Gil Segev and
Ido Shahaf},
title = {Tight Tradeoffs in Searchable Symmetric Encryption},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {507},
year = {2018},
url = {https://eprint.iacr.org/2018/507},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/AsharovSS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/SegevS18,
author = {Gil Segev and
Ido Shahaf},
title = {Ciphertext Expansion in Limited-Leakage Order-Preserving Encryption:
{A} Tight Computational Lower Bound},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {521},
year = {2018},
url = {https://eprint.iacr.org/2018/521},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/SegevS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tcc/MironovSS17,
author = {Ilya Mironov and
Gil Segev and
Ido Shahaf},
editor = {Yael Kalai and
Leonid Reyzin},
title = {Strengthening the Security of Encrypted Databases: Non-transitive
JOINs},
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 = {631--661},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-70503-3\_21},
doi = {10.1007/978-3-319-70503-3\_21},
timestamp = {Sun, 16 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/tcc/MironovSS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tcc/RosenSS17,
author = {Alon Rosen and
Gil Segev and
Ido Shahaf},
editor = {Yael Kalai and
Leonid Reyzin},
title = {Can {PPAD} Hardness be Based on Standard Cryptographic Assumptions?},
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 = {747--776},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-70503-3\_25},
doi = {10.1007/978-3-319-70503-3\_25},
timestamp = {Sun, 16 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/tcc/RosenSS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/MironovSS17,
author = {Ilya Mironov and
Gil Segev and
Ido Shahaf},
title = {Strengthening the Security of Encrypted Databases: Non-Transitive
JOINs},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {883},
year = {2017},
url = {http://eprint.iacr.org/2017/883},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/MironovSS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AsharovNSS16,
author = {Gilad Asharov and
Moni Naor and
Gil Segev and
Ido Shahaf},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Searchable symmetric encryption: optimal locality in linear space
via two-dimensional balanced allocations},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {1101--1114},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897562},
doi = {10.1145/2897518.2897562},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AsharovNSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/RosenSS16,
author = {Alon Rosen and
Gil Segev and
Ido Shahaf},
title = {Can {PPAD} Hardness be Based on Standard Cryptographic Assumptions?},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR16-059}},
year = {2016},
url = {https://eccc.weizmann.ac.il/report/2016/059},
eprinttype = {ECCC},
eprint = {TR16-059},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/RosenSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/AsharovNSS16,
author = {Gilad Asharov and
Moni Naor and
Gil Segev and
Ido Shahaf},
title = {Searchable Symmetric Encryption: Optimal Locality in Linear Space
via Two-Dimensional Balanced Allocations},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {251},
year = {2016},
url = {http://eprint.iacr.org/2016/251},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/AsharovNSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/RosenSS16,
author = {Alon Rosen and
Gil Segev and
Ido Shahaf},
title = {Can {PPAD} Hardness be Based on Standard Cryptographic Assumptions?},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {375},
year = {2016},
url = {http://eprint.iacr.org/2016/375},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/RosenSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-21 17:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
