Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Maciej Obremski
@article{DBLP:journals/tit/AggarwalBJO24, author = {Divesh Aggarwal and Naresh Goud Boddu and Rahul Jain and Maciej Obremski}, title = {Quantum Measurement Adversary}, journal = {{IEEE} Trans. Inf. Theory}, volume = {70}, number = {1}, pages = {318--335}, year = {2024}, url = {https://doi.org/10.1109/TIT.2023.3313149}, doi = {10.1109/TIT.2023.3313149}, timestamp = {Sat, 13 Jan 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tit/AggarwalBJO24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/AggarwalDDHMO23, author = {Divesh Aggarwal and Nico D{\"{o}}ttling and Jesko Dujmovic and Mohammad Hajiabadi and Giulio Malavolta and Maciej Obremski}, title = {Algebraic Restriction Codes and Their Applications}, journal = {Algorithmica}, volume = {85}, number = {12}, pages = {3602--3648}, year = {2023}, url = {https://doi.org/10.1007/s00453-023-01150-y}, doi = {10.1007/S00453-023-01150-Y}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/algorithmica/AggarwalDDHMO23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/citc/LarsenO023, author = {Kasper Green Larsen and Maciej Obremski and Mark Simkin}, editor = {Kai{-}Min Chung}, title = {Distributed Shuffling in Adversarial Environments}, booktitle = {4th Conference on Information-Theoretic Cryptography, {ITC} 2023, June 6-8, 2023, Aarhus University, Aarhus, Denmark}, series = {LIPIcs}, volume = {267}, pages = {10:1--10:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.ITC.2023.10}, doi = {10.4230/LIPICS.ITC.2023.10}, timestamp = {Tue, 25 Jul 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/citc/LarsenO023.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/crypto/AggarwalCO23, author = {Divesh Aggarwal and Eldon Chung and Maciej Obremski}, editor = {Helena Handschuh and Anna Lysyanskaya}, title = {Extractors: Low Entropy Requirements Colliding with Non-malleability}, booktitle = {Advances in Cryptology - {CRYPTO} 2023 - 43rd Annual International Cryptology Conference, {CRYPTO} 2023, Santa Barbara, CA, USA, August 20-24, 2023, Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {14082}, pages = {580--610}, publisher = {Springer}, year = {2023}, url = {https://doi.org/10.1007/978-3-031-38545-2\_19}, doi = {10.1007/978-3-031-38545-2\_19}, timestamp = {Fri, 18 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/crypto/AggarwalCO23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ijcai/SoosA0MO23, author = {Mate Soos and Divesh Aggarwal and Sourav Chakraborty and Kuldeep S. Meel and Maciej Obremski}, title = {Engineering an Efficient Approximate DNF-Counter}, booktitle = {Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, {IJCAI} 2023, 19th-25th August 2023, Macao, SAR, China}, pages = {2031--2038}, publisher = {ijcai.org}, year = {2023}, url = {https://doi.org/10.24963/ijcai.2023/226}, doi = {10.24963/IJCAI.2023/226}, timestamp = {Mon, 28 Aug 2023 17:23:07 +0200}, biburl = {https://dblp.org/rec/conf/ijcai/SoosA0MO23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2306-07583, author = {Nils Fleischhacker and Kasper Green Larsen and Maciej Obremski and Mark Simkin}, title = {Invertible Bloom Lookup Tables with Less Memory and Randomness}, journal = {CoRR}, volume = {abs/2306.07583}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2306.07583}, doi = {10.48550/ARXIV.2306.07583}, eprinttype = {arXiv}, eprint = {2306.07583}, timestamp = {Sat, 17 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2306-07583.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ChungGLOSS23, author = {Eldon Chung and Alexander Golovnev and Zeyong Li and Maciej Obremski and Sidhant Saraogi and Noah Stephens{-}Davidowitz}, title = {On the randomized complexity of range avoidance, with applications to cryptography and metacomplexity}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR23-193}}, year = {2023}, url = {https://eccc.weizmann.ac.il/report/2023/193}, eprinttype = {ECCC}, eprint = {TR23-193}, timestamp = {Wed, 10 Jan 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/eccc/ChungGLOSS23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iacr/AbramOS23, author = {Damiano Abram and Maciej Obremski and Peter Scholl}, title = {On the (Im)possibility of Distributed Samplers: Lower Bounds and Party-Dynamic Constructions}, journal = {{IACR} Cryptol. ePrint Arch.}, pages = {863}, year = {2023}, url = {https://eprint.iacr.org/2023/863}, timestamp = {Mon, 03 Jul 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iacr/AbramOS23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iacr/FleischhackerLOS23, author = {Nils Fleischhacker and Kasper Green Larsen and Maciej Obremski and Mark Simkin}, title = {Invertible Bloom Lookup Tables with Less Memory and Randomness}, journal = {{IACR} Cryptol. ePrint Arch.}, pages = {918}, year = {2023}, url = {https://eprint.iacr.org/2023/918}, timestamp = {Mon, 03 Jul 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iacr/FleischhackerLOS23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/entropy/AggarwalBO22, author = {Divesh Aggarwal and Marshall Ball and Maciej Obremski}, title = {Non-Malleable Code in the Split-State Model}, journal = {Entropy}, volume = {24}, number = {8}, pages = {1038}, year = {2022}, url = {https://doi.org/10.3390/e24081038}, doi = {10.3390/E24081038}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/entropy/AggarwalBO22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tit/AggarwalO00S22, author = {Divesh Aggarwal and Maciej Obremski and Jo{\~{a}}o Ribeiro and Mark Simkin and Luisa Siniscalchi}, title = {Privacy Amplification With Tamperable Memory via Non-Malleable Two-Source Extractors}, journal = {{IEEE} Trans. Inf. Theory}, volume = {68}, number = {8}, pages = {5475--5495}, year = {2022}, url = {https://doi.org/10.1109/TIT.2022.3167404}, doi = {10.1109/TIT.2022.3167404}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tit/AggarwalO00S22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tit/BrianFORSSV22, author = {Gianluca Brian and Antonio Faonio and Maciej Obremski and Jo{\~{a}}o Ribeiro and Mark Simkin and Maciej Sk{\'{o}}rski and Daniele Venturi}, title = {The Mother of All Leakages: How to Simulate Noisy Leakages via Bounded Leakage (Almost) for Free}, journal = {{IEEE} Trans. Inf. Theory}, volume = {68}, number = {12}, pages = {8197--8227}, year = {2022}, url = {https://doi.org/10.1109/TIT.2022.3193848}, doi = {10.1109/TIT.2022.3193848}, timestamp = {Sat, 18 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tit/BrianFORSSV22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/crypto/NielsenRO22, author = {Jesper Buus Nielsen and Jo{\~{a}}o Ribeiro and Maciej Obremski}, editor = {Yevgeniy Dodis and Thomas Shrimpton}, title = {Public Randomness Extraction with Ephemeral Roles and Worst-Case Corruptions}, booktitle = {Advances in Cryptology - {CRYPTO} 2022 - 42nd Annual International Cryptology Conference, {CRYPTO} 2022, Santa Barbara, CA, USA, August 15-18, 2022, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {13507}, pages = {127--147}, publisher = {Springer}, year = {2022}, url = {https://doi.org/10.1007/978-3-031-15802-5\_5}, doi = {10.1007/978-3-031-15802-5\_5}, timestamp = {Sat, 18 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/crypto/NielsenRO22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/AggarwalDDHMO22, author = {Divesh Aggarwal and Nico D{\"{o}}ttling and Jesko Dujmovic and Mohammad Hajiabadi and Giulio Malavolta and Maciej Obremski}, editor = {Mark Braverman}, title = {Algebraic Restriction Codes and Their Applications}, booktitle = {13th Innovations in Theoretical Computer Science Conference, {ITCS} 2022, January 31 - February 3, 2022, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {215}, pages = {2:1--2:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2022.2}, doi = {10.4230/LIPICS.ITCS.2022.2}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/innovations/AggarwalDDHMO22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/AggarwalKOOS22, author = {Divesh Aggarwal and Bhavana Kanukurthi and Sai Lakshmi Bhavana Obbattu and Maciej Obremski and Sruthi Sekar}, editor = {Stefano Leonardi and Anupam Gupta}, title = {Rate one-third non-malleable codes}, booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing, Rome, Italy, June 20 - 24, 2022}, pages = {1364--1377}, publisher = {{ACM}}, year = {2022}, url = {https://doi.org/10.1145/3519935.3519972}, doi = {10.1145/3519935.3519972}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/AggarwalKOOS22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/tcc/AggarwalCOR22, author = {Divesh Aggarwal and Eldon Chung and Maciej Obremski and Jo{\~{a}}o Ribeiro}, editor = {Eike Kiltz and Vinod Vaikuntanathan}, title = {On Secret Sharing, Randomness, and Random-less Reductions for Secret Sharing}, booktitle = {Theory of Cryptography - 20th International Conference, {TCC} 2022, Chicago, IL, USA, November 7-10, 2022, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {13747}, pages = {327--354}, publisher = {Springer}, year = {2022}, url = {https://doi.org/10.1007/978-3-031-22318-1\_12}, doi = {10.1007/978-3-031-22318-1\_12}, timestamp = {Sat, 18 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/tcc/AggarwalCOR22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iacr/NielsenRO22, author = {Jesper Buus Nielsen and Jo{\~{a}}o Ribeiro and Maciej Obremski}, title = {Public Randomness Extraction with Ephemeral Roles and Worst-Case Corruptions}, journal = {{IACR} Cryptol. ePrint Arch.}, pages = {237}, year = {2022}, url = {https://eprint.iacr.org/2022/237}, timestamp = {Sat, 18 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iacr/NielsenRO22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iacr/LarsenOS22, author = {Kasper Green Larsen and Maciej Obremski and Mark Simkin}, title = {Distributed Shuffling in Adversarial Environments}, journal = {{IACR} Cryptol. ePrint Arch.}, pages = {560}, year = {2022}, url = {https://eprint.iacr.org/2022/560}, timestamp = {Mon, 16 May 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iacr/LarsenOS22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iacr/AggarwalBO22, author = {Divesh Aggarwal and Marshall Ball and Maciej Obremski}, title = {Survey: Non-malleable code in the split-state model}, journal = {{IACR} Cryptol. ePrint Arch.}, pages = {1326}, year = {2022}, url = {https://eprint.iacr.org/2022/1326}, timestamp = {Sat, 22 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iacr/AggarwalBO22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/eurocrypt/BrianFO00S021, author = {Gianluca Brian and Antonio Faonio and Maciej Obremski and Jo{\~{a}}o Ribeiro and Mark Simkin and Maciej Sk{\'{o}}rski and Daniele Venturi}, editor = {Anne Canteaut and Fran{\c{c}}ois{-}Xavier Standaert}, title = {The Mother of All Leakages: How to Simulate Noisy Leakages via Bounded Leakage (Almost) for Free}, booktitle = {Advances in Cryptology - {EUROCRYPT} 2021 - 40th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia, October 17-21, 2021, Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {12697}, pages = {408--437}, publisher = {Springer}, year = {2021}, url = {https://doi.org/10.1007/978-3-030-77886-6\_14}, doi = {10.1007/978-3-030-77886-6\_14}, timestamp = {Mon, 28 Aug 2023 21:17:52 +0200}, biburl = {https://dblp.org/rec/conf/eurocrypt/BrianFO00S021.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2106-02766, author = {Divesh Aggarwal and Naresh Goud Boddu and Rahul Jain and Maciej Obremski}, title = {Quantum Measurement Adversary}, journal = {CoRR}, volume = {abs/2106.02766}, year = {2021}, url = {https://arxiv.org/abs/2106.02766}, eprinttype = {arXiv}, eprint = {2106.02766}, timestamp = {Tue, 03 May 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2106-02766.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2111-04157, author = {Eldon Chung and Maciej Obremski and Divesh Aggarwal}, title = {Extractors: Low Entropy Requirements Colliding With Non-Malleability}, journal = {CoRR}, volume = {abs/2111.04157}, year = {2021}, url = {https://arxiv.org/abs/2111.04157}, eprinttype = {arXiv}, eprint = {2111.04157}, timestamp = {Wed, 10 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2111-04157.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/AggarwalCOR21, author = {Divesh Aggarwal and Eldon Chung and Maciej Obremski and Jo{\~{a}}o Ribeiro}, title = {On Secret Sharing, Randomness, and Random-less Reductions for Secret Sharing}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR21-090}}, year = {2021}, url = {https://eccc.weizmann.ac.il/report/2021/090}, eprinttype = {ECCC}, eprint = {TR21-090}, timestamp = {Sat, 18 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/eccc/AggarwalCOR21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/AggarwalKOOS21, author = {Divesh Aggarwal and Bhavana Kanukurthi and Sai Lakshmi Bhavana Obbattu and Maciej Obremski and Sruthi Sekar}, title = {Simplicity Meets Near-Optimal Rate: Non-malleable Codes and Non-malleable Two-source Extractors via Rate Boosters}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR21-117}}, year = {2021}, url = {https://eccc.weizmann.ac.il/report/2021/117}, eprinttype = {ECCC}, eprint = {TR21-117}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/AggarwalKOOS21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ChungOA21, author = {Eldon Chung and Maciej Obremski and Divesh Aggarwal}, title = {Extractors: Low Entropy Requirements Colliding With Non-Malleability}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR21-150}}, year = {2021}, url = {https://eccc.weizmann.ac.il/report/2021/150}, eprinttype = {ECCC}, eprint = {TR21-150}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ChungOA21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iacr/AggarwalCOR21, author = {Divesh Aggarwal and Eldon Chung and Maciej Obremski and Jo{\~{a}}o Ribeiro}, title = {On Secret Sharing, Randomness, and Random-less Reductions for Secret Sharing}, journal = {{IACR} Cryptol. ePrint Arch.}, pages = {802}, year = {2021}, url = {https://eprint.iacr.org/2021/802}, timestamp = {Sat, 18 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iacr/AggarwalCOR21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iacr/AggarwalKOOS21, author = {Divesh Aggarwal and Bhavana Kanukurthi and Sai Lakshmi Bhavana Obbattu and Maciej Obremski and Sruthi Sekar}, title = {Rate One-Third Non-malleable Codes}, journal = {{IACR} Cryptol. ePrint Arch.}, pages = {1042}, year = {2021}, url = {https://eprint.iacr.org/2021/1042}, timestamp = {Mon, 06 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iacr/AggarwalKOOS21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iacr/AggarwalDDHMO21, author = {Divesh Aggarwal and Nico D{\"{o}}ttling and Jesko Dujmovic and Mohammad Hajiabadi and Giulio Malavolta and Maciej Obremski}, title = {Algebraic Restriction Codes and their Applications}, journal = {{IACR} Cryptol. ePrint Arch.}, pages = {1177}, year = {2021}, url = {https://eprint.iacr.org/2021/1177}, timestamp = {Mon, 25 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iacr/AggarwalDDHMO21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iacr/ChungOA21, author = {Eldon Chung and Maciej Obremski and Divesh Aggarwal}, title = {Extractors: Low Entropy Requirements Colliding With Non-Malleability}, journal = {{IACR} Cryptol. ePrint Arch.}, pages = {1480}, year = {2021}, url = {https://eprint.iacr.org/2021/1480}, timestamp = {Fri, 10 Dec 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iacr/ChungOA21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/AggarwalGO0S20, author = {Divesh Aggarwal and Siyao Guo and Maciej Obremski and Jo{\~{a}}o Ribeiro and Noah Stephens{-}Davidowitz}, editor = {Jaroslaw Byrka and Raghu Meka}, title = {Extractor Lower Bounds, Revisited}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, {APPROX/RANDOM} 2020, August 17-19, 2020, Virtual Conference}, series = {LIPIcs}, volume = {176}, pages = {1:1--1:20}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.1}, doi = {10.4230/LIPICS.APPROX/RANDOM.2020.1}, timestamp = {Sat, 18 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/approx/AggarwalGO0S20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/crypto/BrianFO0020, author = {Gianluca Brian and Antonio Faonio and Maciej Obremski and Mark Simkin and Daniele Venturi}, editor = {Daniele Micciancio and Thomas Ristenpart}, title = {Non-malleable Secret Sharing Against Bounded Joint-Tampering Attacks in the Plain Model}, booktitle = {Advances in Cryptology - {CRYPTO} 2020 - 40th Annual International Cryptology Conference, {CRYPTO} 2020, Santa Barbara, CA, USA, August 17-21, 2020, Proceedings, Part {III}}, series = {Lecture Notes in Computer Science}, volume = {12172}, pages = {127--155}, publisher = {Springer}, year = {2020}, url = {https://doi.org/10.1007/978-3-030-56877-1\_5}, doi = {10.1007/978-3-030-56877-1\_5}, timestamp = {Mon, 28 Aug 2023 21:17:50 +0200}, biburl = {https://dblp.org/rec/conf/crypto/BrianFO0020.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/eurocrypt/AggarwalO0SV20, author = {Divesh Aggarwal and Maciej Obremski and Jo{\~{a}}o Ribeiro and Luisa Siniscalchi and Ivan Visconti}, editor = {Anne Canteaut and Yuval Ishai}, title = {How to Extract Useful Randomness from Unreliable Sources}, 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 = {343--372}, publisher = {Springer}, year = {2020}, url = {https://doi.org/10.1007/978-3-030-45721-1\_13}, doi = {10.1007/978-3-030-45721-1\_13}, timestamp = {Sat, 18 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/eurocrypt/AggarwalO0SV20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/AggarwalO20, author = {Divesh Aggarwal and Maciej Obremski}, editor = {Sandy Irani}, title = {A constant rate non-malleable code in the split-state model}, booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS} 2020, Durham, NC, USA, November 16-19, 2020}, pages = {1285--1294}, publisher = {{IEEE}}, year = {2020}, url = {https://doi.org/10.1109/FOCS46700.2020.00122}, doi = {10.1109/FOCS46700.2020.00122}, timestamp = {Wed, 15 Dec 2021 10:49:16 +0100}, biburl = {https://dblp.org/rec/conf/focs/AggarwalO20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isit/ObremskiS20, author = {Maciej Obremski and Maciej Skorski}, title = {Complexity of Estimating R{\'{e}}nyi Entropy of Markov Chains}, booktitle = {{IEEE} International Symposium on Information Theory, {ISIT} 2020, Los Angeles, CA, USA, June 21-26, 2020}, pages = {2264--2269}, publisher = {{IEEE}}, year = {2020}, url = {https://doi.org/10.1109/ISIT44484.2020.9174261}, doi = {10.1109/ISIT44484.2020.9174261}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isit/ObremskiS20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iacr/AggarwalORSS20, author = {Divesh Aggarwal and Maciej Obremski and Jo{\~{a}}o Ribeiro and Mark Simkin and Luisa Siniscalchi}, title = {Computational and Information-Theoretic Two-Source (Non-Malleable) Extractors}, journal = {{IACR} Cryptol. ePrint Arch.}, pages = {259}, year = {2020}, url = {https://eprint.iacr.org/2020/259}, timestamp = {Sat, 18 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iacr/AggarwalORSS20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iacr/BrianFOSV20, author = {Gianluca Brian and Antonio Faonio and Maciej Obremski and Mark Simkin and Daniele Venturi}, title = {Non-Malleable Secret Sharing against Bounded Joint-Tampering Attacks in the Plain Model}, journal = {{IACR} Cryptol. ePrint Arch.}, pages = {725}, year = {2020}, url = {https://eprint.iacr.org/2020/725}, timestamp = {Thu, 21 Jan 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iacr/BrianFOSV20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iacr/BrianFORSSV20, author = {Gianluca Brian and Antonio Faonio and Maciej Obremski and Jo{\~{a}}o Ribeiro and Mark Simkin and Maciej Sk{\'{o}}rski and Daniele Venturi}, title = {The Mother of All Leakages: How to Simulate Noisy Leakages via Bounded Leakage (Almost) for Free}, journal = {{IACR} Cryptol. ePrint Arch.}, pages = {1246}, year = {2020}, url = {https://eprint.iacr.org/2020/1246}, timestamp = {Sat, 18 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iacr/BrianFORSSV20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iacr/AggarwalORSS20a, author = {Divesh Aggarwal and Maciej Obremski and Jo{\~{a}}o Ribeiro and Mark Simkin and Luisa Siniscalchi}, title = {Two-Source Non-Malleable Extractors and Applications to Privacy Amplification with Tamperable Memory}, journal = {{IACR} Cryptol. ePrint Arch.}, pages = {1371}, year = {2020}, url = {https://eprint.iacr.org/2020/1371}, timestamp = {Sat, 18 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iacr/AggarwalORSS20a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/crypto/AggarwalDNOPRS19, author = {Divesh Aggarwal and Ivan Damg{\aa}rd and Jesper Buus Nielsen and Maciej Obremski and Erick Purwanto and Jo{\~{a}}o Ribeiro and Mark Simkin}, editor = {Alexandra Boldyreva and Daniele Micciancio}, title = {Stronger Leakage-Resilient and Non-Malleable Secret Sharing Schemes for General Access Structures}, booktitle = {Advances in Cryptology - {CRYPTO} 2019 - 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2019, Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {11693}, pages = {510--539}, publisher = {Springer}, year = {2019}, url = {https://doi.org/10.1007/978-3-030-26951-7\_18}, doi = {10.1007/978-3-030-26951-7\_18}, timestamp = {Sat, 18 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/crypto/AggarwalDNOPRS19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/eurocrypt/AggarwalDNOP19, author = {Divesh Aggarwal and Nico D{\"{o}}ttling and Jesper Buus Nielsen and Maciej Obremski and Erick Purwanto}, editor = {Yuval Ishai and Vincent Rijmen}, title = {Continuous Non-Malleable Codes in the 8-Split-State Model}, 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 {I}}, series = {Lecture Notes in Computer Science}, volume = {11476}, pages = {531--561}, publisher = {Springer}, year = {2019}, url = {https://doi.org/10.1007/978-3-030-17653-2\_18}, doi = {10.1007/978-3-030-17653-2\_18}, timestamp = {Tue, 14 May 2019 13:47:56 +0200}, biburl = {https://dblp.org/rec/conf/eurocrypt/AggarwalDNOP19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/AggarwalGORS19, author = {Divesh Aggarwal and Siyao Guo and Maciej Obremski and Jo{\~{a}}o Ribeiro and Noah Stephens{-}Davidowitz}, title = {Extractor Lower Bounds, Revisited}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR19-173}}, year = {2019}, url = {https://eccc.weizmann.ac.il/report/2019/173}, eprinttype = {ECCC}, eprint = {TR19-173}, timestamp = {Sat, 18 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/eccc/AggarwalGORS19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iacr/AggarwalO19, author = {Divesh Aggarwal and Maciej Obremski}, title = {Inception makes non-malleable codes shorter as well!}, journal = {{IACR} Cryptol. ePrint Arch.}, pages = {399}, year = {2019}, url = {https://eprint.iacr.org/2019/399}, timestamp = {Mon, 11 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iacr/AggarwalO19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iacr/ObremskiS19, author = {Maciej Obremski and Maciej Skorski}, title = {Complexity of Estimating Renyi Entropy of Markov Chains}, journal = {{IACR} Cryptol. ePrint Arch.}, pages = {766}, year = {2019}, url = {https://eprint.iacr.org/2019/766}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iacr/ObremskiS19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iacr/AggarwalORSV19, author = {Divesh Aggarwal and Maciej Obremski and Jo{\~{a}}o Ribeiro and Luisa Siniscalchi and Ivan Visconti}, title = {How to Extract Useful Randomness from Unreliable Sources}, journal = {{IACR} Cryptol. ePrint Arch.}, pages = {1156}, year = {2019}, url = {https://eprint.iacr.org/2019/1156}, timestamp = {Sat, 18 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iacr/AggarwalORSV19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iacr/AggarwalO19a, author = {Divesh Aggarwal and Maciej Obremski}, title = {A constant-rate non-malleable code in the split-state model}, journal = {{IACR} Cryptol. ePrint Arch.}, pages = {1299}, year = {2019}, url = {https://eprint.iacr.org/2019/1299}, timestamp = {Mon, 11 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iacr/AggarwalO19a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isit/AggarwalKO18, author = {Divesh Aggarwal and Tomasz Kazana and Maciej Obremski}, title = {Leakage-Resilient Algebraic Manipulation Detection Codes with Optimal Parameters}, booktitle = {2018 {IEEE} International Symposium on Information Theory, {ISIT} 2018, Vail, CO, USA, June 17-22, 2018}, pages = {1131--1135}, publisher = {{IEEE}}, year = {2018}, url = {https://doi.org/10.1109/ISIT.2018.8437762}, doi = {10.1109/ISIT.2018.8437762}, timestamp = {Wed, 16 Oct 2019 14:14:48 +0200}, biburl = {https://dblp.org/rec/conf/isit/AggarwalKO18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isit/ObremskiS18, author = {Maciej Obremski and Maciej Skorski}, title = {Inverted Leftover Hash Lemma}, booktitle = {2018 {IEEE} International Symposium on Information Theory, {ISIT} 2018, Vail, CO, USA, June 17-22, 2018}, pages = {1834--1838}, publisher = {{IEEE}}, year = {2018}, url = {https://doi.org/10.1109/ISIT.2018.8437654}, doi = {10.1109/ISIT.2018.8437654}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isit/ObremskiS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/tcc/DamgardKORS18, author = {Ivan Damg{\aa}rd and Tomasz Kazana and Maciej Obremski and Varun Raj and Luisa Siniscalchi}, editor = {Amos Beimel and Stefan Dziembowski}, title = {Continuous {NMC} Secure Against Permutations and Overwrites, with Applications to {CCA} Secure Commitments}, 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 = {225--254}, publisher = {Springer}, year = {2018}, url = {https://doi.org/10.1007/978-3-030-03810-6\_9}, doi = {10.1007/978-3-030-03810-6\_9}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/tcc/DamgardKORS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iacr/AggarwalKO18, author = {Divesh Aggarwal and Tomasz Kazana and Maciej Obremski}, title = {Leakage-resilient Algebraic Manipulation Detection Codes with Optimal Parameters}, journal = {{IACR} Cryptol. ePrint Arch.}, pages = {58}, year = {2018}, url = {http://eprint.iacr.org/2018/058}, timestamp = {Mon, 11 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iacr/AggarwalKO18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iacr/DamgardKORS18, author = {Ivan Damg{\aa}rd and Tomasz Kazana and Maciej Obremski and Varun Raj and Luisa Siniscalchi}, title = {Continuous {NMC} Secure Against Permutations and Overwrites, with Applications to {CCA} Secure Commitments}, journal = {{IACR} Cryptol. ePrint Arch.}, pages = {596}, year = {2018}, url = {https://eprint.iacr.org/2018/596}, timestamp = {Mon, 11 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iacr/DamgardKORS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iacr/AggarwalDNOPRS18, author = {Divesh Aggarwal and Ivan Damg{\aa}rd and Jesper Buus Nielsen and Maciej Obremski and Erick Purwanto and Jo{\~{a}}o Ribeiro and Mark Simkin}, title = {Stronger Leakage-Resilient and Non-Malleable Secret-Sharing Schemes for General Access Structures}, journal = {{IACR} Cryptol. ePrint Arch.}, pages = {1147}, year = {2018}, url = {https://eprint.iacr.org/2018/1147}, timestamp = {Sat, 18 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iacr/AggarwalDNOPRS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/ObremskiS17, author = {Maciej Obremski and Maciej Skorski}, editor = {Klaus Jansen and Jos{\'{e}} D. P. Rolim and David Williamson and Santosh S. Vempala}, title = {Renyi Entropy Estimation Revisited}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {81}, pages = {20:1--20:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.20}, doi = {10.4230/LIPICS.APPROX-RANDOM.2017.20}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/approx/ObremskiS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/tcc/AggarwalKO17, author = {Divesh Aggarwal and Tomasz Kazana and Maciej Obremski}, editor = {Yael Kalai and Leonid Reyzin}, title = {Inception Makes Non-malleable Codes Stronger}, 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 = {319--343}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-70503-3\_10}, doi = {10.1007/978-3-319-70503-3\_10}, timestamp = {Tue, 14 May 2019 10:00:47 +0200}, biburl = {https://dblp.org/rec/conf/tcc/AggarwalKO17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/DottlingNO17, author = {Nico D{\"{o}}ttling and Jesper Buus Nielsen and Maciej Obremski}, title = {Information Theoretic Continuously Non-Malleable Codes in the Constant Split-State Model}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR17-078}}, year = {2017}, url = {https://eccc.weizmann.ac.il/report/2017/078}, eprinttype = {ECCC}, eprint = {TR17-078}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/DottlingNO17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iacr/DottlingNO17, author = {Nico D{\"{o}}ttling and Jesper Buus Nielsen and Maciej Obremski}, title = {Information Theoretic Continuously Non-Malleable Codes in the Constant Split-State Model}, journal = {{IACR} Cryptol. ePrint Arch.}, pages = {357}, year = {2017}, url = {http://eprint.iacr.org/2017/357}, timestamp = {Mon, 11 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iacr/DottlingNO17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iacr/ObremskiS17, author = {Maciej Obremski and Maciej Skorski}, title = {Inverted Leftover Hash Lemma}, journal = {{IACR} Cryptol. ePrint Arch.}, pages = {507}, year = {2017}, url = {http://eprint.iacr.org/2017/507}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iacr/ObremskiS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iacr/ObremskiS17a, author = {Maciej Obremski and Maciej Skorski}, title = {Renyi Entropy Estimation Revisited}, journal = {{IACR} Cryptol. ePrint Arch.}, pages = {588}, year = {2017}, url = {http://eprint.iacr.org/2017/588}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iacr/ObremskiS17a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/AggarwalDKO15, author = {Divesh Aggarwal and Yevgeniy Dodis and Tomasz Kazana and Maciej Obremski}, editor = {Rocco A. Servedio and Ronitt Rubinfeld}, title = {Non-malleable Reductions and Applications}, booktitle = {Proceedings of the Forty-Seventh Annual {ACM} on Symposium on Theory of Computing, {STOC} 2015, Portland, OR, USA, June 14-17, 2015}, pages = {459--468}, publisher = {{ACM}}, year = {2015}, url = {https://doi.org/10.1145/2746539.2746544}, doi = {10.1145/2746539.2746544}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/AggarwalDKO15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/tcc/AggarwalDKO15, author = {Divesh Aggarwal and Stefan Dziembowski and Tomasz Kazana and Maciej Obremski}, editor = {Yevgeniy Dodis and Jesper Buus Nielsen}, title = {Leakage-Resilient Non-malleable Codes}, 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 = {398--426}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-46494-6\_17}, doi = {10.1007/978-3-662-46494-6\_17}, timestamp = {Tue, 20 Aug 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/tcc/AggarwalDKO15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iacr/AggarwalKO15, author = {Divesh Aggarwal and Tomasz Kazana and Maciej Obremski}, title = {Inception Makes Non-malleable Codes Stronger}, journal = {{IACR} Cryptol. ePrint Arch.}, pages = {1013}, year = {2015}, url = {http://eprint.iacr.org/2015/1013}, timestamp = {Mon, 11 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iacr/AggarwalKO15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/AggarwalDKO14, author = {Divesh Aggarwal and Yevgeniy Dodis and Tomasz Kazana and Maciej Obremski}, title = {Non-malleable Reductions and Applications}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR14-128}}, year = {2014}, url = {https://eccc.weizmann.ac.il/report/2014/128}, eprinttype = {ECCC}, eprint = {TR14-128}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/AggarwalDKO14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/AggarwalDKO14a, author = {Divesh Aggarwal and Stefan Dziembowski and Tomasz Kazana and Maciej Obremski}, title = {Leakage-resilient non-malleable codes}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR14-129}}, year = {2014}, url = {https://eccc.weizmann.ac.il/report/2014/129}, eprinttype = {ECCC}, eprint = {TR14-129}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/AggarwalDKO14a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iacr/AggarwalDKO14, author = {Divesh Aggarwal and Stefan Dziembowski and Tomasz Kazana and Maciej Obremski}, title = {Leakage-resilient non-malleable codes}, journal = {{IACR} Cryptol. ePrint Arch.}, pages = {807}, year = {2014}, url = {http://eprint.iacr.org/2014/807}, timestamp = {Sat, 09 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iacr/AggarwalDKO14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iacr/AggarwalDKO14a, author = {Divesh Aggarwal and Yevgeniy Dodis and Tomasz Kazana and Maciej Obremski}, title = {Non-malleable Reductions and Applications}, journal = {{IACR} Cryptol. ePrint Arch.}, pages = {821}, year = {2014}, url = {http://eprint.iacr.org/2014/821}, timestamp = {Mon, 11 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iacr/AggarwalDKO14a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/crypto/DziembowskiKO13, author = {Stefan Dziembowski and Tomasz Kazana and Maciej Obremski}, editor = {Ran Canetti and Juan A. Garay}, title = {Non-malleable Codes from Two-Source Extractors}, booktitle = {Advances in Cryptology - {CRYPTO} 2013 - 33rd Annual Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2013. Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {8043}, pages = {239--257}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-40084-1\_14}, doi = {10.1007/978-3-642-40084-1\_14}, timestamp = {Tue, 14 May 2019 10:00:48 +0200}, biburl = {https://dblp.org/rec/conf/crypto/DziembowskiKO13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iacr/DziembowskiKO13, author = {Stefan Dziembowski and Tomasz Kazana and Maciej Obremski}, title = {Non-Malleable Codes from Two-Source Extractors}, journal = {{IACR} Cryptol. ePrint Arch.}, pages = {498}, year = {2013}, url = {http://eprint.iacr.org/2013/498}, timestamp = {Sat, 09 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iacr/DziembowskiKO13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.