Spoof odd perfect numbers. - Samuel J. Dittmer (Math. Comput., 2014)

Counting linear extensions and contingency tables. - Samuel J. Dittmer (2019)

Counting Linear Extensions of Restricted Posets. - Samuel J. Dittmer; Igor Pak (Electron. J. Comb., 2020)

Function Secret Sharing for PSI-CA: With Applications to Private Contact Tracing. - Samuel Dittmer; Yuval Ishai; Steve Lu 001; Rafail Ostrovsky; Mohamed Elsabagh; Nikolaos Kiourtis; Brian Schulte; Angelos Stavrou (IACR Cryptol. ePrint Arch., 2020)

Line-Point Zero Knowledge and Its Applications. - Samuel Dittmer; Yuval Ishai; Rafail Ostrovsky (IACR Cryptol. ePrint Arch., 2020)

Oblivious tight compaction in O(n) time with smaller constant. - Samuel Dittmer; Rafail Ostrovsky (IACR Cryptol. ePrint Arch., 2020)

Streaming and Unbalanced PSI from Function Secret Sharing. - Samuel Dittmer; Yuval Ishai; Steve Lu 001; Rafail Ostrovsky; Mohamed Elsabagh; Nikolaos Kiourtis; Brian Schulte; Angelos Stavrou (SCN, 2022)

Secure Merge in Linear Time and O(log log N) Rounds. - Mark Blunk; Paul Bunn; Samuel Dittmer; Steve Lu 001; Rafail Ostrovsky (IACR Cryptol. ePrint Arch., 2022)

Improving Line-Point Zero Knowledge: Two Multiplications for the Price of One. - Samuel Dittmer; Yuval Ishai; Steve Lu 001; Rafail Ostrovsky (IACR Cryptol. ePrint Arch., 2022)

Authenticated Garbling from Simple Correlations. - Samuel Dittmer; Yuval Ishai; Steve Lu 001; Rafail Ostrovsky (IACR Cryptol. ePrint Arch., 2022)

Boosting the Performance of High-Assurance Cryptography: Parallel Execution and Optimizing Memory Access in Formally-Verified Line-Point Zero-Knowledge. - Samuel Dittmer; Karim Eldefrawy; Stéphane Graham-Lengrand; Steve Lu 001; Rafail Ostrovsky; Vitor Pereira 002 (IACR Cryptol. ePrint Arch., 2023)

Sok: vector OLE-based zero-knowledge protocols. - Carsten Baum; Samuel Dittmer; Peter Scholl; Xiao Wang 012 (Des. Codes Cryptogr., 2023)

Rabbit-Mix: Robust Algebraic Anonymous Broadcast from Additive Bases. - Chongwon Cho; Samuel Dittmer; Yuval Ishai; Steve Lu 001; Rafail Ostrovsky (USENIX Security Symposium, 2024)

Linear-Time Secure Merge in O(loglog n) Rounds. - Mark Blunk; Paul Bunn; Samuel Dittmer; Steve Lu 001; Rafail Ostrovsky (ITC, 2025)

1-private n-party AND from 5 random bits. - Samuel Dittmer; Rafail Ostrovsky (IACR Cryptol. ePrint Arch., 2025)