Boosting the Performance of High-Assurance Cryptography: Parallel Execution and Optimizing Memory Access in Formally-Verified Line-Point Zero-Knowledge.

[BibT_eX]

[DOI]

Samuel Dittmer

Karim Eldefrawy

Stéphane Graham-Lengrand

Steve Lu

Rafail Ostrovsky

Vitor Pereira

Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, 2023

2022

Secure Merge in Linear Time and O(log log N) Rounds.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

Streaming and Unbalanced PSI from Function Secret Sharing.

[BibT_eX]

[DOI]

Proceedings of the Security and Cryptography for Networks - 13th International Conference, 2022

Authenticated Garbling from Simple Correlations.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

Improving Line-Point Zero Knowledge: Two Multiplications for the Price of One.

[BibT_eX]

[DOI]

Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022

2021

Line-Point Zero Knowledge and Its Applications.

[BibT_eX]

[DOI]

Samuel Dittmer

Yuval Ishai

Rafail Ostrovsky

Proceedings of the 2nd Conference on Information-Theoretic Cryptography, 2021

2020

Function Secret Sharing for PSI-CA: With Applications to Private Contact Tracing.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Counting Linear Extensions of Restricted Posets.

[BibT_eX]

[DOI]

Samuel J. Dittmer

Igor Pak

Electron. J. Comb., 2020

Oblivious Tight Compaction In O(n) Time with Smaller Constant.

[BibT_eX]

[DOI]

Samuel Dittmer

Rafail Ostrovsky

Proceedings of the Security and Cryptography for Networks - 12th International Conference, 2020

2019

Counting linear extensions and contingency tables.

[BibT_eX]

[DOI]

Samuel J. Dittmer

PhD thesis, 2019

2014

Spoof odd perfect numbers.

[BibT_eX]

[DOI]

Samuel J. Dittmer

Math. Comput., 2014

Samuel Dittmer

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...