9 Publications

Mark all

[9]
2019 | Conference Paper | IST-REx-ID: 7136   OA
Skórski, Maciej. “Strong Chain Rules for Min-Entropy under Few Bits Spoiled.” 2019 IEEE International Symposium on Information Theory, 8849240, IEEE, 2019, doi:10.1109/isit.2019.8849240.
View | DOI | Download (ext.) | arXiv
 
[8]
2018 | Conference Paper | IST-REx-ID: 108   OA
Obremski, Marciej, and Maciej Skorski. Inverted Leftover Hash Lemma. Vol. 2018, IEEE, 2018, doi:10.1109/ISIT.2018.8437654.
View | DOI | Download (ext.)
 
[7]
2017 | Conference Paper | IST-REx-ID: 1178   OA
Skórski, Maciej. Simulating Auxiliary Inputs, Revisited. Vol. 9985, Springer, 2017, pp. 159–79, doi:10.1007/978-3-662-53641-4_7.
View | DOI | Download (ext.)
 
[6]
2017 | Conference Paper | IST-REx-ID: 648   OA
Skórski, Maciej. On the Complexity of Breaking Pseudoentropy. Edited by Gerhard Jäger and Silvia Steila, vol. 10185, Springer, 2017, pp. 600–13, doi:10.1007/978-3-319-55911-7_43.
View | DOI | Download (ext.)
 
[5]
2017 | Conference Paper | IST-REx-ID: 650   OA
Skórski, Maciej. A Cryptographic View of Regularity Lemmas: Simpler Unified Proofs and Refined Bounds. Edited by Gerhard Jäger and Silvia Steila, vol. 10185, Springer, 2017, pp. 586–99, doi:10.1007/978-3-319-55911-7_42.
View | DOI | Download (ext.)
 
[4]
2017 | Conference Paper | IST-REx-ID: 1174   OA
Skórski, Maciej. Lower Bounds on Key Derivation for Square-Friendly Applications. Vol. 66, 57, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.STACS.2017.57.
View | DOI | Download (ext.)
 
[3]
2017 | Conference Paper | IST-REx-ID: 710   OA
Obremski, Maciej, and Maciej Skórski. Renyi Entropy Estimation Revisited. Vol. 81, 20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.APPROX-RANDOM.2017.20.
View | Files available | DOI
 
[2]
2017 | Conference Paper | IST-REx-ID: 6526   OA
Skórski, Maciej. “On the Complexity of Estimating Rènyi Divergences.” 2017 IEEE International Symposium on Information Theory (ISIT), 8006529, IEEE, 2017, doi:10.1109/isit.2017.8006529.
View | DOI | Download (ext.) | arXiv
 
[1]
2017 | Conference Paper | IST-REx-ID: 697   OA
Pietrzak, Krzysztof Z., and Maciej Skórski. Non Uniform Attacks against Pseudoentropy. Vol. 80, 39, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.ICALP.2017.39.
View | Files available | DOI
 

Search

Filter Publications

Display / Sort

Export / Embed

9 Publications

Mark all

[9]
2019 | Conference Paper | IST-REx-ID: 7136   OA
Skórski, Maciej. “Strong Chain Rules for Min-Entropy under Few Bits Spoiled.” 2019 IEEE International Symposium on Information Theory, 8849240, IEEE, 2019, doi:10.1109/isit.2019.8849240.
View | DOI | Download (ext.) | arXiv
 
[8]
2018 | Conference Paper | IST-REx-ID: 108   OA
Obremski, Marciej, and Maciej Skorski. Inverted Leftover Hash Lemma. Vol. 2018, IEEE, 2018, doi:10.1109/ISIT.2018.8437654.
View | DOI | Download (ext.)
 
[7]
2017 | Conference Paper | IST-REx-ID: 1178   OA
Skórski, Maciej. Simulating Auxiliary Inputs, Revisited. Vol. 9985, Springer, 2017, pp. 159–79, doi:10.1007/978-3-662-53641-4_7.
View | DOI | Download (ext.)
 
[6]
2017 | Conference Paper | IST-REx-ID: 648   OA
Skórski, Maciej. On the Complexity of Breaking Pseudoentropy. Edited by Gerhard Jäger and Silvia Steila, vol. 10185, Springer, 2017, pp. 600–13, doi:10.1007/978-3-319-55911-7_43.
View | DOI | Download (ext.)
 
[5]
2017 | Conference Paper | IST-REx-ID: 650   OA
Skórski, Maciej. A Cryptographic View of Regularity Lemmas: Simpler Unified Proofs and Refined Bounds. Edited by Gerhard Jäger and Silvia Steila, vol. 10185, Springer, 2017, pp. 586–99, doi:10.1007/978-3-319-55911-7_42.
View | DOI | Download (ext.)
 
[4]
2017 | Conference Paper | IST-REx-ID: 1174   OA
Skórski, Maciej. Lower Bounds on Key Derivation for Square-Friendly Applications. Vol. 66, 57, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.STACS.2017.57.
View | DOI | Download (ext.)
 
[3]
2017 | Conference Paper | IST-REx-ID: 710   OA
Obremski, Maciej, and Maciej Skórski. Renyi Entropy Estimation Revisited. Vol. 81, 20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.APPROX-RANDOM.2017.20.
View | Files available | DOI
 
[2]
2017 | Conference Paper | IST-REx-ID: 6526   OA
Skórski, Maciej. “On the Complexity of Estimating Rènyi Divergences.” 2017 IEEE International Symposium on Information Theory (ISIT), 8006529, IEEE, 2017, doi:10.1109/isit.2017.8006529.
View | DOI | Download (ext.) | arXiv
 
[1]
2017 | Conference Paper | IST-REx-ID: 697   OA
Pietrzak, Krzysztof Z., and Maciej Skórski. Non Uniform Attacks against Pseudoentropy. Vol. 80, 39, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.ICALP.2017.39.
View | Files available | DOI
 

Search

Filter Publications

Display / Sort

Export / Embed