( en | de | ru )

 

Disambiguation of "Obremski, Maciej"

Author of the publication

copydeleteadd this publication to your clipboard
The Mother of All Leakages: How to Simulate Noisy Leakages via Bounded Leakage (Almost) for Free.

, , , , , , and . IEEE Trans. Inf. Theory, 68 (12): 8197-8227 (2022)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Caesar Obremski

Maciej Wojnowski

Bernd Maciej

Maciej Czajkowski

Josefine Maciej

 

Other publications of authors with the same name

The Mother of All Leakages: How to Simulate Noisy Leakages via Bounded Leakage (Almost) for Free., , , , , , and . IEEE Trans. Inf. Theory, 68 (12): 8197-8227 (2022)The Mother of All Leakages: How to Simulate Noisy Leakages via Bounded Leakage (Almost) for Free., , , , , , and . EUROCRYPT (2), volume 12697 of Lecture Notes in Computer Science, page 408-437. Springer, (2021)Engineering an Efficient Approximate DNF-Counter., , , , and . IJCAI, page 2031-2038. ijcai.org, (2023)Stronger Leakage-Resilient and Non-Malleable Secret Sharing Schemes for General Access Structures., , , , , , and . CRYPTO (2), volume 11693 of Lecture Notes in Computer Science, page 510-539. Springer, (2019)Algebraic Restriction Codes and Their Applications., , , , , and . ITCS, volume 215 of LIPIcs, page 2:1-2:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)On Secret Sharing, Randomness, and Random-less Reductions for Secret Sharing., , , and . TCC (1), volume 13747 of Lecture Notes in Computer Science, page 327-354. Springer, (2022)Continuous NMC Secure Against Permutations and Overwrites, with Applications to CCA Secure Commitments., , , , and . TCC (2), volume 11240 of Lecture Notes in Computer Science, page 225-254. Springer, (2018)A constant rate non-malleable code in the split-state model., and . FOCS, page 1285-1294. IEEE, (2020)How to Extract Useful Randomness from Unreliable Sources., , , , and . EUROCRYPT (1), volume 12105 of Lecture Notes in Computer Science, page 343-372. Springer, (2020)Public Randomness Extraction with Ephemeral Roles and Worst-Case Corruptions., , and . CRYPTO (1), volume 13507 of Lecture Notes in Computer Science, page 127-147. Springer, (2022)