default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMaciej Obremski
Person information
- affiliation: National University of Singapore, Singapore
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j5]Divesh Aggarwal, Naresh Goud Boddu
, Rahul Jain, Maciej Obremski:
Quantum Measurement Adversary. IEEE Trans. Inf. Theory 70(1): 318-335 (2024)- [c25]Maciej Obremski, João Ribeiro, Lawrence Roy, François-Xavier Standaert, Daniele Venturi:
Improved Reductions from Noisy to Bounded and Probing Leakages via Hockey-Stick Divergences. CRYPTO (6) 2024: 461-491 - [c24]Nils Fleischhacker, Kasper Green Larsen, Maciej Obremski, Mark Simkin:
Invertible Bloom Lookup Tables with Less Memory and Randomness. ESA 2024: 54:1-54:17 - [i41]Mate Soos, Uddalok Sarkar, Divesh Aggarwal, Sourav Chakraborty, Kuldeep S. Meel, Maciej Obremski:
Engineering an Efficient Approximate DNF-Counter. CoRR abs/2407.19946 (2024) - [i40]Divesh Aggarwal, Pranjal Dutta, Zeyong Li, Maciej Obremski, Sidhant Saraogi:
Improved Lower Bounds for 3-Query Matching Vector Codes. Electron. Colloquium Comput. Complex. TR24 (2024) - [i39]Maciej Obremski, João Ribeiro, Lawrence Roy, François-Xavier Standaert, Daniele Venturi:
Improved Reductions from Noisy to Bounded and Probing Leakages via Hockey-Stick Divergences. IACR Cryptol. ePrint Arch. 2024: 1009 (2024) - 2023
- [j4]Divesh Aggarwal, Nico Döttling, Jesko Dujmovic, Mohammad Hajiabadi, Giulio Malavolta, Maciej Obremski:
Algebraic Restriction Codes and Their Applications. Algorithmica 85(12): 3602-3648 (2023) - [c23]Kasper Green Larsen, Maciej Obremski, Mark Simkin:
Distributed Shuffling in Adversarial Environments. ITC 2023: 10:1-10:15 - [c22]Divesh Aggarwal, Eldon Chung, Maciej Obremski:
Extractors: Low Entropy Requirements Colliding with Non-malleability. CRYPTO (2) 2023: 580-610 - [c21]Mate Soos, Divesh Aggarwal, Sourav Chakraborty, Kuldeep S. Meel, Maciej Obremski:
Engineering an Efficient Approximate DNF-Counter. IJCAI 2023: 2031-2038 - [i38]Nils Fleischhacker, Kasper Green Larsen, Maciej Obremski, Mark Simkin:
Invertible Bloom Lookup Tables with Less Memory and Randomness. CoRR abs/2306.07583 (2023) - [i37]Eldon Chung, Alexander Golovnev, Zeyong Li, Maciej Obremski, Sidhant Saraogi, Noah Stephens-Davidowitz:
On the randomized complexity of range avoidance, with applications to cryptography and metacomplexity. Electron. Colloquium Comput. Complex. TR23 (2023) - [i36]Damiano Abram, Maciej Obremski, Peter Scholl:
On the (Im)possibility of Distributed Samplers: Lower Bounds and Party-Dynamic Constructions. IACR Cryptol. ePrint Arch. 2023: 863 (2023) - [i35]Nils Fleischhacker, Kasper Green Larsen, Maciej Obremski, Mark Simkin:
Invertible Bloom Lookup Tables with Less Memory and Randomness. IACR Cryptol. ePrint Arch. 2023: 918 (2023) - 2022
- [j3]Divesh Aggarwal, Marshall Ball, Maciej Obremski:
Non-Malleable Code in the Split-State Model. Entropy 24(8): 1038 (2022) - [j2]Divesh Aggarwal, Maciej Obremski, João Ribeiro, Mark Simkin, Luisa Siniscalchi:
Privacy Amplification With Tamperable Memory via Non-Malleable Two-Source Extractors. IEEE Trans. Inf. Theory 68(8): 5475-5495 (2022) - [j1]Gianluca Brian, Antonio Faonio, Maciej Obremski, João Ribeiro, Mark Simkin, Maciej Skórski, Daniele Venturi:
The Mother of All Leakages: How to Simulate Noisy Leakages via Bounded Leakage (Almost) for Free. IEEE Trans. Inf. Theory 68(12): 8197-8227 (2022) - [c20]Jesper Buus Nielsen, João Ribeiro, Maciej Obremski:
Public Randomness Extraction with Ephemeral Roles and Worst-Case Corruptions. CRYPTO (1) 2022: 127-147 - [c19]Divesh Aggarwal, Nico Döttling, Jesko Dujmovic, Mohammad Hajiabadi, Giulio Malavolta, Maciej Obremski:
Algebraic Restriction Codes and Their Applications. ITCS 2022: 2:1-2:15 - [c18]Divesh Aggarwal, Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu, Maciej Obremski, Sruthi Sekar:
Rate one-third non-malleable codes. STOC 2022: 1364-1377 - [c17]Divesh Aggarwal, Eldon Chung, Maciej Obremski, João Ribeiro:
On Secret Sharing, Randomness, and Random-less Reductions for Secret Sharing. TCC (1) 2022: 327-354 - [i34]Jesper Buus Nielsen, João Ribeiro, Maciej Obremski:
Public Randomness Extraction with Ephemeral Roles and Worst-Case Corruptions. IACR Cryptol. ePrint Arch. 2022: 237 (2022) - [i33]Kasper Green Larsen, Maciej Obremski, Mark Simkin:
Distributed Shuffling in Adversarial Environments. IACR Cryptol. ePrint Arch. 2022: 560 (2022) - [i32]Divesh Aggarwal, Marshall Ball, Maciej Obremski:
Survey: Non-malleable code in the split-state model. IACR Cryptol. ePrint Arch. 2022: 1326 (2022) - 2021
- [c16]Gianluca Brian, Antonio Faonio, Maciej Obremski, João Ribeiro, Mark Simkin, Maciej Skórski, Daniele Venturi:
The Mother of All Leakages: How to Simulate Noisy Leakages via Bounded Leakage (Almost) for Free. EUROCRYPT (2) 2021: 408-437 - [i31]Divesh Aggarwal, Naresh Goud Boddu, Rahul Jain, Maciej Obremski:
Quantum Measurement Adversary. CoRR abs/2106.02766 (2021) - [i30]Eldon Chung, Maciej Obremski, Divesh Aggarwal:
Extractors: Low Entropy Requirements Colliding With Non-Malleability. CoRR abs/2111.04157 (2021) - [i29]Divesh Aggarwal, Eldon Chung, Maciej Obremski, João Ribeiro:
On Secret Sharing, Randomness, and Random-less Reductions for Secret Sharing. Electron. Colloquium Comput. Complex. TR21 (2021) - [i28]Divesh Aggarwal, Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu, Maciej Obremski, Sruthi Sekar:
Simplicity Meets Near-Optimal Rate: Non-malleable Codes and Non-malleable Two-source Extractors via Rate Boosters. Electron. Colloquium Comput. Complex. TR21 (2021) - [i27]Eldon Chung, Maciej Obremski, Divesh Aggarwal:
Extractors: Low Entropy Requirements Colliding With Non-Malleability. Electron. Colloquium Comput. Complex. TR21 (2021) - [i26]Divesh Aggarwal, Eldon Chung, Maciej Obremski, João Ribeiro:
On Secret Sharing, Randomness, and Random-less Reductions for Secret Sharing. IACR Cryptol. ePrint Arch. 2021: 802 (2021) - [i25]Divesh Aggarwal, Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu, Maciej Obremski, Sruthi Sekar:
Rate One-Third Non-malleable Codes. IACR Cryptol. ePrint Arch. 2021: 1042 (2021) - [i24]Divesh Aggarwal, Nico Döttling, Jesko Dujmovic, Mohammad Hajiabadi, Giulio Malavolta, Maciej Obremski:
Algebraic Restriction Codes and their Applications. IACR Cryptol. ePrint Arch. 2021: 1177 (2021) - [i23]Eldon Chung, Maciej Obremski, Divesh Aggarwal:
Extractors: Low Entropy Requirements Colliding With Non-Malleability. IACR Cryptol. ePrint Arch. 2021: 1480 (2021) - 2020
- [c15]Divesh Aggarwal, Siyao Guo, Maciej Obremski, João Ribeiro, Noah Stephens-Davidowitz:
Extractor Lower Bounds, Revisited. APPROX-RANDOM 2020: 1:1-1:20 - [c14]Gianluca Brian, Antonio Faonio, Maciej Obremski, Mark Simkin, Daniele Venturi:
Non-malleable Secret Sharing Against Bounded Joint-Tampering Attacks in the Plain Model. CRYPTO (3) 2020: 127-155 - [c13]Divesh Aggarwal, Maciej Obremski, João Ribeiro, Luisa Siniscalchi, Ivan Visconti:
How to Extract Useful Randomness from Unreliable Sources. EUROCRYPT (1) 2020: 343-372 - [c12]Divesh Aggarwal, Maciej Obremski:
A constant rate non-malleable code in the split-state model. FOCS 2020: 1285-1294 - [c11]Maciej Obremski, Maciej Skorski:
Complexity of Estimating Rényi Entropy of Markov Chains. ISIT 2020: 2264-2269 - [i22]Divesh Aggarwal, Maciej Obremski, João Ribeiro, Mark Simkin, Luisa Siniscalchi:
Computational and Information-Theoretic Two-Source (Non-Malleable) Extractors. IACR Cryptol. ePrint Arch. 2020: 259 (2020) - [i21]Gianluca Brian, Antonio Faonio, Maciej Obremski, Mark Simkin, Daniele Venturi:
Non-Malleable Secret Sharing against Bounded Joint-Tampering Attacks in the Plain Model. IACR Cryptol. ePrint Arch. 2020: 725 (2020) - [i20]Gianluca Brian, Antonio Faonio, Maciej Obremski, João Ribeiro, Mark Simkin, Maciej Skórski, Daniele Venturi:
The Mother of All Leakages: How to Simulate Noisy Leakages via Bounded Leakage (Almost) for Free. IACR Cryptol. ePrint Arch. 2020: 1246 (2020) - [i19]Divesh Aggarwal, Maciej Obremski, João Ribeiro, Mark Simkin, Luisa Siniscalchi:
Two-Source Non-Malleable Extractors and Applications to Privacy Amplification with Tamperable Memory. IACR Cryptol. ePrint Arch. 2020: 1371 (2020)
2010 – 2019
- 2019
- [c10]Divesh Aggarwal, Ivan Damgård, Jesper Buus Nielsen, Maciej Obremski, Erick Purwanto, João Ribeiro, Mark Simkin:
Stronger Leakage-Resilient and Non-Malleable Secret Sharing Schemes for General Access Structures. CRYPTO (2) 2019: 510-539 - [c9]Divesh Aggarwal, Nico Döttling, Jesper Buus Nielsen, Maciej Obremski, Erick Purwanto:
Continuous Non-Malleable Codes in the 8-Split-State Model. EUROCRYPT (1) 2019: 531-561 - [i18]Divesh Aggarwal, Siyao Guo, Maciej Obremski, João Ribeiro, Noah Stephens-Davidowitz:
Extractor Lower Bounds, Revisited. Electron. Colloquium Comput. Complex. TR19 (2019) - [i17]Divesh Aggarwal, Maciej Obremski:
Inception makes non-malleable codes shorter as well! IACR Cryptol. ePrint Arch. 2019: 399 (2019) - [i16]Maciej Obremski, Maciej Skorski:
Complexity of Estimating Renyi Entropy of Markov Chains. IACR Cryptol. ePrint Arch. 2019: 766 (2019) - [i15]Divesh Aggarwal, Maciej Obremski, João Ribeiro, Luisa Siniscalchi, Ivan Visconti:
How to Extract Useful Randomness from Unreliable Sources. IACR Cryptol. ePrint Arch. 2019: 1156 (2019) - [i14]Divesh Aggarwal, Maciej Obremski:
A constant-rate non-malleable code in the split-state model. IACR Cryptol. ePrint Arch. 2019: 1299 (2019) - 2018
- [c8]Divesh Aggarwal, Tomasz Kazana, Maciej Obremski:
Leakage-Resilient Algebraic Manipulation Detection Codes with Optimal Parameters. ISIT 2018: 1131-1135 - [c7]Maciej Obremski, Maciej Skorski:
Inverted Leftover Hash Lemma. ISIT 2018: 1834-1838 - [c6]Ivan Damgård, Tomasz Kazana, Maciej Obremski, Varun Raj, Luisa Siniscalchi:
Continuous NMC Secure Against Permutations and Overwrites, with Applications to CCA Secure Commitments. TCC (2) 2018: 225-254 - [i13]Divesh Aggarwal, Tomasz Kazana, Maciej Obremski:
Leakage-resilient Algebraic Manipulation Detection Codes with Optimal Parameters. IACR Cryptol. ePrint Arch. 2018: 58 (2018) - [i12]Ivan Damgård, Tomasz Kazana, Maciej Obremski, Varun Raj, Luisa Siniscalchi:
Continuous NMC Secure Against Permutations and Overwrites, with Applications to CCA Secure Commitments. IACR Cryptol. ePrint Arch. 2018: 596 (2018) - [i11]Divesh Aggarwal, Ivan Damgård, Jesper Buus Nielsen, Maciej Obremski, Erick Purwanto, João Ribeiro, Mark Simkin:
Stronger Leakage-Resilient and Non-Malleable Secret-Sharing Schemes for General Access Structures. IACR Cryptol. ePrint Arch. 2018: 1147 (2018) - 2017
- [c5]Maciej Obremski, Maciej Skorski:
Renyi Entropy Estimation Revisited. APPROX-RANDOM 2017: 20:1-20:15 - [c4]Divesh Aggarwal, Tomasz Kazana, Maciej Obremski:
Inception Makes Non-malleable Codes Stronger. TCC (2) 2017: 319-343 - [i10]Nico Döttling, Jesper Buus Nielsen, Maciej Obremski:
Information Theoretic Continuously Non-Malleable Codes in the Constant Split-State Model. Electron. Colloquium Comput. Complex. TR17 (2017) - [i9]Nico Döttling, Jesper Buus Nielsen, Maciej Obremski:
Information Theoretic Continuously Non-Malleable Codes in the Constant Split-State Model. IACR Cryptol. ePrint Arch. 2017: 357 (2017) - [i8]Maciej Obremski, Maciej Skorski:
Inverted Leftover Hash Lemma. IACR Cryptol. ePrint Arch. 2017: 507 (2017) - [i7]Maciej Obremski, Maciej Skorski:
Renyi Entropy Estimation Revisited. IACR Cryptol. ePrint Arch. 2017: 588 (2017) - 2015
- [c3]Divesh Aggarwal, Yevgeniy Dodis, Tomasz Kazana, Maciej Obremski:
Non-malleable Reductions and Applications. STOC 2015: 459-468 - [c2]Divesh Aggarwal, Stefan Dziembowski, Tomasz Kazana, Maciej Obremski:
Leakage-Resilient Non-malleable Codes. TCC (1) 2015: 398-426 - [i6]Divesh Aggarwal, Tomasz Kazana, Maciej Obremski:
Inception Makes Non-malleable Codes Stronger. IACR Cryptol. ePrint Arch. 2015: 1013 (2015) - 2014
- [i5]Divesh Aggarwal, Yevgeniy Dodis, Tomasz Kazana, Maciej Obremski:
Non-malleable Reductions and Applications. Electron. Colloquium Comput. Complex. TR14 (2014) - [i4]Divesh Aggarwal, Stefan Dziembowski, Tomasz Kazana, Maciej Obremski:
Leakage-resilient non-malleable codes. Electron. Colloquium Comput. Complex. TR14 (2014) - [i3]Divesh Aggarwal, Stefan Dziembowski, Tomasz Kazana, Maciej Obremski:
Leakage-resilient non-malleable codes. IACR Cryptol. ePrint Arch. 2014: 807 (2014) - [i2]Divesh Aggarwal, Yevgeniy Dodis, Tomasz Kazana, Maciej Obremski:
Non-malleable Reductions and Applications. IACR Cryptol. ePrint Arch. 2014: 821 (2014) - 2013
- [c1]Stefan Dziembowski, Tomasz Kazana, Maciej Obremski:
Non-malleable Codes from Two-Source Extractors. CRYPTO (2) 2013: 239-257 - [i1]Stefan Dziembowski, Tomasz Kazana, Maciej Obremski:
Non-Malleable Codes from Two-Source Extractors. IACR Cryptol. ePrint Arch. 2013: 498 (2013)
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-26 01:53 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:
