Michal Osadnik

Orcid: 0000-0003-4000-3241

According to our database1, Michal Osadnik authored at least 8 papers between 2022 and 2026.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Cyclo: Lightweight Lattice-Based Folding via Partial Range Checks.
Proceedings of the Advances in Cryptology - EUROCRYPT 2026, 2026

2025
SALSAA - Sumcheck-Aided Lattice-based Succinct Arguments and Applications.
IACR Cryptol. ePrint Arch., 2025

RoK and Roll - Verifier-Efficient Random Projection for Õ(λ)-size Lattice Arguments.
IACR Cryptol. ePrint Arch., 2025

Papercraft: Lattice-Based Verifiable Delay Function Implemented.
Proceedings of the IEEE Symposium on Security and Privacy, 2025

RoK and Roll - Verifier-Efficient Random Projection for O~(λ)-Size Lattice Arguments - (Extended Abstract).
Proceedings of the Advances in Cryptology - ASIACRYPT 2025, 2025

2024
RoK, Paper, SISsors - Toolkit for Lattice-based Succinct Arguments.
IACR Cryptol. ePrint Arch., 2024

RoK, Paper, SISsors Toolkit for Lattice-Based Succinct Arguments - (Extended Abstract).
Proceedings of the Advances in Cryptology - ASIACRYPT 2024, 2024

2022
Clustering with Fair-Center Representation: Parameterized Approximation Algorithms and Heuristics.
Proceedings of the KDD '22: The 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Washington, DC, USA, August 14, 2022


  Loading...