Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Silas Richelson
@article{DBLP:journals/tit/RichelsonR24,
author = {Silas Richelson and
Sourya Roy},
title = {Analyzing Ta-Shma's Code via the Expander Mixing Lemma},
journal = {{IEEE} Trans. Inf. Theory},
volume = {70},
number = {2},
pages = {1040--1049},
year = {2024},
url = {https://doi.org/10.1109/TIT.2023.3304614},
doi = {10.1109/TIT.2023.3304614},
timestamp = {Thu, 29 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/RichelsonR24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2402-18365,
author = {Abdulrahman Bin Rabiah and
Anas Alsoliman and
Yugarshi Shashwat and
Silas Richelson and
Nael B. Abu{-}Ghazaleh},
title = {Token-based Vehicular Security System {(TVSS):} Scalable, Secure,
Low-latency Public Key Infrastructure for Connected Vehicles},
journal = {CoRR},
volume = {abs/2402.18365},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2402.18365},
doi = {10.48550/ARXIV.2402.18365},
eprinttype = {arXiv},
eprint = {2402.18365},
timestamp = {Tue, 26 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2402-18365.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/crypto/NewtonR22,
author = {Parker Newton and
Silas Richelson},
editor = {Helena Handschuh and
Anna Lysyanskaya},
title = {A Lower Bound for Proving Hardness of Learning with Rounding with
Polynomial Modulus},
booktitle = {Advances in Cryptology - {CRYPTO} 2023 - 43rd Annual International
Cryptology Conference, {CRYPTO} 2023, Santa Barbara, CA, USA, August
20-24, 2023, Proceedings, Part {V}},
series = {Lecture Notes in Computer Science},
volume = {14085},
pages = {805--835},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-38554-4\_26},
doi = {10.1007/978-3-031-38554-4\_26},
timestamp = {Tue, 26 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/crypto/NewtonR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/RichelsonR23,
author = {Silas Richelson and
Sourya Roy},
title = {Gilbert and Varshamov Meet Johnson: List-Decoding Explicit Nearly-Optimal
Binary Codes},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {194--205},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00021},
doi = {10.1109/FOCS57990.2023.00021},
timestamp = {Tue, 02 Jan 2024 14:56:14 +0100},
biburl = {https://dblp.org/rec/conf/focs/RichelsonR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/NewtonRW23,
author = {Parker Newton and
Silas Richelson and
Chase Wilson},
editor = {Barna Saha and
Rocco A. Servedio},
title = {A High Dimensional Goldreich-Levin Theorem},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1463--1474},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585224},
doi = {10.1145/3564246.3585224},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/NewtonRW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/NewtonRW23,
author = {Parker Newton and
Silas Richelson and
Chase Wilson},
title = {A High Dimensional Goldreich-Levin Theorem},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR23-088}},
year = {2023},
url = {https://eccc.weizmann.ac.il/report/2023/088},
eprinttype = {ECCC},
eprint = {TR23-088},
timestamp = {Tue, 13 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/NewtonRW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2201-11166,
author = {Silas Richelson and
Sourya Roy},
title = {Analyzing Ta-Shma's Code via the Expander Mixing Lemma},
journal = {CoRR},
volume = {abs/2201.11166},
year = {2022},
url = {https://arxiv.org/abs/2201.11166},
eprinttype = {arXiv},
eprint = {2201.11166},
timestamp = {Tue, 01 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2201-11166.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/RichelsonR22,
author = {Silas Richelson and
Sourya Roy},
title = {Analyzing Ta-Shma's Code via the Expander Mixing Lemma},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR22-004}},
year = {2022},
url = {https://eccc.weizmann.ac.il/report/2022/004},
eprinttype = {ECCC},
eprint = {TR22-004},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/RichelsonR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/RichelsonR22a,
author = {Silas Richelson and
Sourya Roy},
title = {List-Decoding Random Walk {XOR} Codes Near the Johnson Bound},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR22-069}},
year = {2022},
url = {https://eccc.weizmann.ac.il/report/2022/069},
eprinttype = {ECCC},
eprint = {TR22-069},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/RichelsonR22a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/NewtonR22,
author = {Parker Newton and
Silas Richelson},
title = {A Lower Bound for Proving Hardness of Learning with Rounding with
Polynomial Modulus},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {727},
year = {2022},
url = {https://eprint.iacr.org/2022/727},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/NewtonR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GoyalRRV21,
author = {Vipul Goyal and
Silas Richelson and
Alon Rosen and
Margarita Vald},
title = {An Algebraic Approach to Nonmalleability},
journal = {{SIAM} J. Comput.},
volume = {50},
number = {5},
pages = {1537--1579},
year = {2021},
url = {https://doi.org/10.1137/16M1073595},
doi = {10.1137/16M1073595},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GoyalRRV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icdcn/RabiahRRRLK21,
author = {Abdulrahman Bin Rabiah and
K. K. Ramakrishnan and
Silas Richelson and
Ahmad Bin Rabiah and
Elizabeth Liri and
Koushik Kar},
title = {Haiku: Efficient Authenticated Key Agreement with Strong Security
Guarantees for IoT},
booktitle = {{ICDCN} '21: International Conference on Distributed Computing and
Networking, Virtual Event, Nara, Japan, January 5-8, 2021},
pages = {196--205},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3427796.3427817},
doi = {10.1145/3427796.3427817},
timestamp = {Tue, 19 Jan 2021 17:08:16 +0100},
biburl = {https://dblp.org/rec/conf/icdcn/RabiahRRRLK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icdcs/RabiahSARA21,
author = {Abdulrahman Bin Rabiah and
Yugarshi Shashwat and
Fatemah Alharbi and
Silas Richelson and
Nael B. Abu{-}Ghazaleh},
title = {{MSS:} Lightweight network authentication for resource constrained
devices via Mergeable Stateful Signatures},
booktitle = {41st {IEEE} International Conference on Distributed Computing Systems,
{ICDCS} 2021, Washington DC, USA, July 7-10, 2021},
pages = {282--292},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/ICDCS51616.2021.00035},
doi = {10.1109/ICDCS51616.2021.00035},
timestamp = {Wed, 13 Oct 2021 15:47:30 +0200},
biburl = {https://dblp.org/rec/conf/icdcs/RabiahSARA21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/uss/AlharbiARRA21,
author = {Fatemah Alharbi and
Arwa Alrawais and
Abdulrahman Bin Rabiah and
Silas Richelson and
Nael B. Abu{-}Ghazaleh},
editor = {Michael D. Bailey and
Rachel Greenstadt},
title = {CSProp: Ciphertext and Signature Propagation Low-Overhead Public-Key
Cryptosystem for IoT Environments},
booktitle = {30th {USENIX} Security Symposium, {USENIX} Security 2021, August 11-13,
2021},
pages = {609--626},
publisher = {{USENIX} Association},
year = {2021},
url = {https://www.usenix.org/conference/usenixsecurity21/presentation/alharbi},
timestamp = {Mon, 20 Nov 2023 08:57:49 +0100},
biburl = {https://dblp.org/rec/conf/uss/AlharbiARRA21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GoyalR19,
author = {Vipul Goyal and
Silas Richelson},
editor = {David Zuckerman},
title = {Non-Malleable Commitments using Goldreich-Levin List Decoding},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {686--699},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00047},
doi = {10.1109/FOCS.2019.00047},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/GoyalR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/HorelPRV19,
author = {Thibaut Horel and
Sunoo Park and
Silas Richelson and
Vinod Vaikuntanathan},
editor = {Avrim Blum},
title = {How to Subvert Backdoored Encryption: Security Against Adversaries
that Decrypt All Ciphertexts},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {42:1--42:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.42},
doi = {10.4230/LIPICS.ITCS.2019.42},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/HorelPRV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/RichelsonR19,
author = {Silas Richelson and
Sourya Roy},
title = {Locally Testable Non-Malleable Codes},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-117}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/117},
eprinttype = {ECCC},
eprint = {TR19-117},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/RichelsonR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/GoyalR19,
author = {Vipul Goyal and
Silas Richelson},
title = {Non-Malleable Commitments Using Goldreich-Levin List Decoding},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {1195},
year = {2019},
url = {https://eprint.iacr.org/2019/1195},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/GoyalR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1802-07381,
author = {Thibaut Horel and
Sunoo Park and
Silas Richelson and
Vinod Vaikuntanathan},
title = {How to Subvert Backdoored Encryption: Security Against Adversaries
that Decrypt All Ciphertexts},
journal = {CoRR},
volume = {abs/1802.07381},
year = {2018},
url = {http://arxiv.org/abs/1802.07381},
eprinttype = {arXiv},
eprint = {1802.07381},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1802-07381.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/HorelPRV18,
author = {Thibaut Horel and
Sunoo Park and
Silas Richelson and
Vinod Vaikuntanathan},
title = {How to Subvert Backdoored Encryption: Security Against Adversaries
that Decrypt All Ciphertexts},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {212},
year = {2018},
url = {http://eprint.iacr.org/2018/212},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/HorelPRV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pkc/CanettiRRV17,
author = {Ran Canetti and
Srinivasan Raghuraman and
Silas Richelson and
Vinod Vaikuntanathan},
editor = {Serge Fehr},
title = {Chosen-Ciphertext Secure Fully Homomorphic Encryption},
booktitle = {Public-Key Cryptography - {PKC} 2017 - 20th {IACR} International Conference
on Practice and Theory in Public-Key Cryptography, Amsterdam, The
Netherlands, March 28-31, 2017, Proceedings, Part {II}},
series = {Lecture Notes in Computer Science},
volume = {10175},
pages = {213--240},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-662-54388-7\_8},
doi = {10.1007/978-3-662-54388-7\_8},
timestamp = {Fri, 01 May 2020 18:32:25 +0200},
biburl = {https://dblp.org/rec/conf/pkc/CanettiRRV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tcc/CanettiHR17,
author = {Ran Canetti and
Justin Holmgren and
Silas Richelson},
editor = {Yael Kalai and
Leonid Reyzin},
title = {Towards Doubly Efficient Private Information Retrieval},
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 = {694--726},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-70503-3\_23},
doi = {10.1007/978-3-319-70503-3\_23},
timestamp = {Tue, 14 May 2019 10:00:47 +0200},
biburl = {https://dblp.org/rec/conf/tcc/CanettiHR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/CanettiHR17,
author = {Ran Canetti and
Justin Holmgren and
Silas Richelson},
title = {Towards Doubly Efficient Private Information Retrieval},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {568},
year = {2017},
url = {http://eprint.iacr.org/2017/568},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/CanettiHR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GoyalPR16,
author = {Vipul Goyal and
Omkant Pandey and
Silas Richelson},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Textbook non-malleable commitments},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {1128--1141},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897657},
doi = {10.1145/2897518.2897657},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/GoyalPR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tcc/BogdanovGMRR16,
author = {Andrej Bogdanov and
Siyao Guo and
Daniel Masny and
Silas Richelson and
Alon Rosen},
editor = {Eyal Kushilevitz and
Tal Malkin},
title = {On the Hardness of Learning with Rounding over Small Modulus},
booktitle = {Theory of Cryptography - 13th International Conference, {TCC} 2016-A,
Tel Aviv, Israel, January 10-13, 2016, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {9562},
pages = {209--224},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-662-49096-9\_9},
doi = {10.1007/978-3-662-49096-9\_9},
timestamp = {Tue, 14 May 2019 10:00:47 +0200},
biburl = {https://dblp.org/rec/conf/tcc/BogdanovGMRR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tcc/HemenwayORR16,
author = {Brett Hemenway and
Rafail Ostrovsky and
Silas Richelson and
Alon Rosen},
editor = {Eyal Kushilevitz and
Tal Malkin},
title = {Adaptive Security with Quasi-Optimal Rate},
booktitle = {Theory of Cryptography - 13th International Conference, {TCC} 2016-A,
Tel Aviv, Israel, January 10-13, 2016, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {9562},
pages = {525--541},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-662-49096-9\_22},
doi = {10.1007/978-3-662-49096-9\_22},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/tcc/HemenwayORR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ccs/BrennerGRRV15,
author = {Hai Brenner and
Vipul Goyal and
Silas Richelson and
Alon Rosen and
Margarita Vald},
editor = {Indrajit Ray and
Ninghui Li and
Christopher Kruegel},
title = {Fast Non-Malleable Commitments},
booktitle = {Proceedings of the 22nd {ACM} {SIGSAC} Conference on Computer and
Communications Security, Denver, CO, USA, October 12-16, 2015},
pages = {1048--1057},
publisher = {{ACM}},
year = {2015},
url = {https://doi.org/10.1145/2810103.2813721},
doi = {10.1145/2810103.2813721},
timestamp = {Tue, 10 Nov 2020 19:58:09 +0100},
biburl = {https://dblp.org/rec/conf/ccs/BrennerGRRV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/crypto/OstrovskyRS15,
author = {Rafail Ostrovsky and
Silas Richelson and
Alessandra Scafuro},
editor = {Rosario Gennaro and
Matthew Robshaw},
title = {Round-Optimal Black-Box Two-Party Computation},
booktitle = {Advances in Cryptology - {CRYPTO} 2015 - 35th Annual Cryptology Conference,
Santa Barbara, CA, USA, August 16-20, 2015, Proceedings, Part {II}},
series = {Lecture Notes in Computer Science},
volume = {9216},
pages = {339--358},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-48000-7\_17},
doi = {10.1007/978-3-662-48000-7\_17},
timestamp = {Tue, 20 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/crypto/OstrovskyRS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tcc/MoranOR15,
author = {Tal Moran and
Ilan Orlov and
Silas Richelson},
editor = {Yevgeniy Dodis and
Jesper Buus Nielsen},
title = {Topology-Hiding Computation},
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 = {159--181},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-46494-6\_8},
doi = {10.1007/978-3-662-46494-6\_8},
timestamp = {Tue, 20 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/tcc/MoranOR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/OstrovskyRS15,
author = {Rafail Ostrovsky and
Silas Richelson and
Alessandra Scafuro},
title = {Round-Optimal Black-Box Two-Party Computation},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {553},
year = {2015},
url = {http://eprint.iacr.org/2015/553},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/OstrovskyRS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/BogdanovGMRR15,
author = {Andrej Bogdanov and
Siyao Guo and
Daniel Masny and
Silas Richelson and
Alon Rosen},
title = {On the Hardness of Learning with Rounding over Small Modulus},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {769},
year = {2015},
url = {http://eprint.iacr.org/2015/769},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/BogdanovGMRR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/GoyalPR15,
author = {Vipul Goyal and
Omkant Pandey and
Silas Richelson},
title = {Textbook Non-Malleable Commitments},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {1178},
year = {2015},
url = {http://eprint.iacr.org/2015/1178},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/GoyalPR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/basesearch/Richelson14,
author = {Silas Richelson},
title = {Cryptographic Protocols with Strong Security: Non-Malleable Commitments,
Concurrent Zero-Knowledge and Topology-Hiding Multi-Party Computation},
school = {University of California, Los Angeles, {USA}},
year = {2014},
url = {http://www.escholarship.org/uc/item/1fj534j8},
timestamp = {Fri, 05 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/basesearch/Richelson14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GoyalRRV14,
author = {Vipul Goyal and
Silas Richelson and
Alon Rosen and
Margarita Vald},
title = {An Algebraic Approach to Non-malleability},
booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2014, Philadelphia, PA, USA, October 18-21, 2014},
pages = {41--50},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/FOCS.2014.13},
doi = {10.1109/FOCS.2014.13},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GoyalRRV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/GoyalRRV14,
author = {Vipul Goyal and
Silas Richelson and
Alon Rosen and
Margarita Vald},
title = {An Algebraic Approach to Non-Malleability},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {586},
year = {2014},
url = {http://eprint.iacr.org/2014/586},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/GoyalRRV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/MoranOR14,
author = {Tal Moran and
Ilan Orlov and
Silas Richelson},
title = {Topology-Hiding Computation},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {1022},
year = {2014},
url = {http://eprint.iacr.org/2014/1022},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/MoranOR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/asiacrypt/Goyal0ORV13,
author = {Vipul Goyal and
Abhishek Jain and
Rafail Ostrovsky and
Silas Richelson and
Ivan Visconti},
editor = {Kazue Sako and
Palash Sarkar},
title = {Constant-Round Concurrent Zero Knowledge in the Bounded Player Model},
booktitle = {Advances in Cryptology - {ASIACRYPT} 2013 - 19th International Conference
on the Theory and Application of Cryptology and Information Security,
Bengaluru, India, December 1-5, 2013, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {8269},
pages = {21--40},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-42033-7\_2},
doi = {10.1007/978-3-642-42033-7\_2},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/asiacrypt/Goyal0ORV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tcc/Goyal0ORV13,
author = {Vipul Goyal and
Abhishek Jain and
Rafail Ostrovsky and
Silas Richelson and
Ivan Visconti},
editor = {Amit Sahai},
title = {Concurrent Zero Knowledge in the Bounded Player Model},
booktitle = {Theory of Cryptography - 10th Theory of Cryptography Conference, {TCC}
2013, Tokyo, Japan, March 3-6, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7785},
pages = {60--79},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-36594-2\_4},
doi = {10.1007/978-3-642-36594-2\_4},
timestamp = {Tue, 14 May 2019 10:00:47 +0200},
biburl = {https://dblp.org/rec/conf/tcc/Goyal0ORV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/JainORV12,
author = {Abhishek Jain and
Rafail Ostrovsky and
Silas Richelson and
Ivan Visconti},
title = {Concurrent Zero Knowledge in the Bounded Player Model},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {279},
year = {2012},
url = {http://eprint.iacr.org/2012/279},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/JainORV12.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-25 01:39 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:
