Daniel S. Roche

86 papers A* 9B 18Journal 53Unranked 5

Year	Rank	Type	Title / Venue / Authors
2025	—	`conf`	Optimal Communication Unbalanced Private Set Union. ACNS (2) Jean-Guillaume Dumas, Alexis Galan, Bruno Grenet, Aude Maignan, Daniel S. Roche
2024	J	`jnl`	Communication Optimal Unbalanced Private Set Union. CoRR Jean-Guillaume Dumas, Alexis Galan, Bruno Grenet, Aude Maignan, Daniel S. Roche
2024	B	`conf`	Corrigimus, verificamus, vincimus: Ensuring algorithmic accuracy in an age of uncertainty. ISSAC Daniel S. Roche
2024	B	`conf`	Fast interpolation and multiplication of unbalanced polynomials. ISSAC Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray, Daniel S. Roche
2024	J	`jnl`	Fast interpolation and multiplication of unbalanced polynomials. CoRR Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray, Daniel S. Roche
2023	J	`jnl`	VESPo: Verified Evaluation of Secret Polynomials (with application to dynamic proofs of retrievability). Proc. Priv. Enhancing Technol. Jean-Guillaume Dumas, Aude Maignan, Clément Pernet, Daniel S. Roche
2022	A*	`conf`	Fighting Fake News in Encrypted Messaging with the Fuzzy Anonymous Complaint Tally System (FACTS). NDSS Linsheng Liu, Daniel S. Roche, Austin Theriault, Arkady Yerukhimovich
2022	B	`conf`	Random Primes without Primality Testing. ISSAC Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray, Daniel S. Roche
2022	J	`jnl`	Random primes in arithmetic progressions. CoRR Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray, Daniel S. Roche
2022	J	`jnl`	Random primes in arithmetic progressions. IACR Cryptol. ePrint Arch. Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray, Daniel S. Roche
2022	J	`jnl`	Random primes without primality testing. CoRR Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray, Daniel S. Roche
2022	B	`conf`	Sparse Polynomial Interpolation and Division in Soft-linear Time. ISSAC Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray, Daniel S. Roche
2022	J	`jnl`	Sparse polynomial interpolation and division in soft-linear time. CoRR Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray, Daniel S. Roche
2021	A*	`conf`	Dynamic proofs of retrievability with low server storage. USENIX Security Symposium Gaspard Anthoine, Jean-Guillaume Dumas, Mélanie de Jonghe, Aude Maignan, Clément Pernet, Michael Hanling, Daniel S. Roche
2021	J	`jnl`	Fighting Fake News in Encrypted Messaging with the Fuzzy Anonymous Complaint Tally System (FACTS). CoRR Linsheng Liu, Daniel S. Roche, Austin Theriault, Arkady Yerukhimovich
2021	J	`jnl`	Fighting Fake News in Encrypted Messaging with the Fuzzy Anonymous Complaint Tally System (FACTS). IACR Cryptol. ePrint Arch. Linsheng Liu, Daniel S. Roche, Austin Theriault, Arkady Yerukhimovich
2021	A*	`conf`	Improving Signal's Sealed Sender. NDSS Ian Martiny, Gabriel Kaptchuk, Adam J. Aviv, Daniel S. Roche, Eric Wustrow
2021	J	`jnl`	VESPo: Verified Evaluation of Secret Polynomials. CoRR Jean-Guillaume Dumas, Aude Maignan, Clément Pernet, Daniel S. Roche
2021	J	`jnl`	Verification protocols with sub-linear communication for polynomial matrix operations. J. Symb. Comput. David Lucas, Vincent Neiger, Clément Pernet, Daniel S. Roche, Johan Rosenkilde
2020	J	`jnl`	Dynamic proofs of retrievability with low server storage. CoRR Gaspard Anthoine, Jean-Guillaume Dumas, Michael Hanling, Mélanie de Jonghe, Aude Maignan, Clément Pernet, Daniel S. Roche
2020	B	`conf`	Fast in-place algorithms for polynomial operations: division, evaluation, interpolation. ISSAC Pascal Giorgi, Bruno Grenet, Daniel S. Roche
2020	J	`jnl`	Fast in-place algorithms for polynomial operations: division, evaluation, interpolation. CoRR Pascal Giorgi, Bruno Grenet, Daniel S. Roche
2020	—	`conf`	Twice as Nice? A Preliminary Evaluation of Double Android Unlock Patterns. CHI Extended Abstracts Timothy J. Forman, Daniel S. Roche, Adam J. Aviv
2019	B	`conf`	Generic Reductions for In-place Polynomial Multiplication. ISSAC Pascal Giorgi, Bruno Grenet, Daniel S. Roche
2019	J	`jnl`	Generic reductions for in-place polynomial multiplication. CoRR Pascal Giorgi, Bruno Grenet, Daniel S. Roche
2019	J	`jnl`	Improving the Complexity of Block Low-Rank Factorizations with Fast Matrix Arithmetic. SIAM J. Matrix Anal. Appl. Claude-Pierre Jeannerod, Théo Mary, Clément Pernet, Daniel S. Roche
2019	B	`conf`	LU Factorization with Errors. ISSAC Jean-Guillaume Dumas, Joris van der Hoeven, Clément Pernet, Daniel S. Roche
2019	J	`jnl`	LU factorization with errors. CoRR Jean-Guillaume Dumas, Joris van der Hoeven, Clément Pernet, Daniel S. Roche
2019	A*	`conf`	Poster: Proofs of Retrievability with Low Server Storage. CCS Michael Hanling, Gaspard Anthoine, Jean-Guillaume Dumas, Aude Maignan, Clément Pernet, Daniel S. Roche
2019	A*	`conf`	rORAM: Efficient Range ORAM with O(log2 N) Locality. NDSS Anrin Chakraborti, Adam J. Aviv, Seung Geol Choi, Travis Mayberry, Daniel S. Roche, Radu Sion
2018	J	`jnl`	Efficient Range ORAM with 핆(log IACR Cryptol. ePrint Arch. Anrin Chakraborti, Adam J. Aviv, Seung Geol Choi, Travis Mayberry, Daniel S. Roche, Radu Sion
2018	B	`conf`	Error Correction in Fast Matrix Multiplication and Inverse. ISSAC Daniel S. Roche
2018	J	`jnl`	Error correction in fast matrix multiplication and inverse. CoRR Daniel S. Roche
2018	J	`jnl`	Interactive Certificates for Polynomial Matrices with Sub-Linear Communication. CoRR David Lucas, Vincent Neiger, Clément Pernet, Daniel S. Roche, Johan Rosenkilde
2018	—	`conf`	New Instantiations of the CRYPTO 2017 Masking Schemes. ASIACRYPT (2) Pierre Karpman, Daniel S. Roche
2018	J	`jnl`	New Instantiations of the CRYPTO 2017 Masking Schemes. CoRR Pierre Karpman, Daniel S. Roche
2018	J	`jnl`	New Instantiations of the CRYPTO 2017 Masking Schemes. IACR Cryptol. ePrint Arch. Pierre Karpman, Daniel S. Roche
2018	B	`conf`	What Can (and Can't) we Do with Sparse Polynomials? ISSAC Daniel S. Roche
2018	J	`jnl`	What Can (and Can't) we Do with Sparse Polynomials? CoRR Daniel S. Roche
2017	A*	`conf`	Deterministic, Stash-Free Write-Only ORAM. CCS Daniel S. Roche, Adam J. Aviv, Seung Geol Choi, Travis Mayberry
2017	J	`jnl`	Deterministic, Stash-Free Write-Only ORAM. CoRR Daniel S. Roche, Adam J. Aviv, Seung Geol Choi, Travis Mayberry
2017	J	`jnl`	Deterministic, Stash-Free Write-Only ORAM. IACR Cryptol. ePrint Arch. Daniel S. Roche, Adam J. Aviv, Seung Geol Choi, Travis Mayberry
2017	A*	`conf`	ObliviSync: Practical Oblivious File Backup and Synchronization. NDSS Adam J. Aviv, Seung Geol Choi, Travis Mayberry, Daniel S. Roche
2016	A*	`conf`	A Practical Oblivious Map Data Structure with Secure Deletion and History Independence. IEEE Symposium on Security and Privacy Daniel S. Roche, Adam J. Aviv, Seung Geol Choi
2016	J	`jnl`	Faster sparse multivariate polynomial interpolation of straight-line programs. J. Symb. Comput. Andrew Arnold, Mark Giesbrecht, Daniel S. Roche
2016	B	`conf`	Managing Cloud Storage Obliviously. CLOUD Vaishali Narkhede, Karuna P. Joshi, Adam J. Aviv, Seung Geol Choi, Daniel S. Roche, Tim Finin
2016	J	`jnl`	ObliviSync: Practical Oblivious File Backup and Synchronization. CoRR Adam J. Aviv, Seung Geol Choi, Travis Mayberry, Daniel S. Roche
2016	J	`jnl`	ObliviSync: Practical Oblivious File Backup and Synchronization. IACR Cryptol. ePrint Arch. Adam J. Aviv, Seung Geol Choi, Travis Mayberry, Daniel S. Roche
2016	A*	`conf`	POPE: Partial Order Preserving Encoding. CCS Daniel S. Roche, Daniel Apon, Seung Geol Choi, Arkady Yerukhimovich
2016	J	`jnl`	POPE: Partial Order Preserving Encoding. CoRR Daniel S. Roche, Daniel Apon, Seung Geol Choi, Arkady Yerukhimovich
2016	J	`jnl`	Sparse polynomials in FLINT. ACM Commun. Comput. Algebra A. Whitman Groves, Daniel S. Roche
2015	J	`jnl`	A Practical Oblivious Map Data Structure with Secure Deletion and History Independence. IACR Cryptol. ePrint Arch. Daniel S. Roche, Adam J. Aviv, Seung Geol Choi
2015	J	`jnl`	Oblivious Secure Deletion with Bounded History Independence. CoRR Daniel S. Roche, Adam J. Aviv, Seung Geol Choi
2015	B	`conf`	Output-Sensitive Algorithms for Sumset and Sparse Polynomial Multiplication. ISSAC Andrew Arnold, Daniel S. Roche
2015	J	`jnl`	Output-sensitive algorithms for sumset and sparse polynomial multiplication. CoRR Andrew Arnold, Daniel S. Roche
2015	J	`jnl`	POPE: Partial Order-Preserving Encoding. IACR Cryptol. ePrint Arch. Daniel S. Roche, Daniel Apon, Seung Geol Choi, Arkady Yerukhimovich
2015	—	`conf`	Parallel sparse interpolation using small primes. PASCO Mohamed Khochtali, Daniel S. Roche, Xisen Tian
2015	J	`jnl`	Parallel sparse interpolation using small primes. CoRR Mohamed Khochtali, Daniel S. Roche, Xisen Tian
2014	J	`jnl`	Faster Sparse Multivariate Polynomial Interpolation of Straight-Line Programs. CoRR Andrew Arnold, Mark Giesbrecht, Daniel S. Roche
2014	J	`jnl`	Faster sparse polynomial interpolation of straight-line programs over finite fields. CoRR Andrew Arnold, Mark Giesbrecht, Daniel S. Roche
2014	B	`conf`	Multivariate sparse interpolation using randomized Kronecker substitutions. ISSAC Andrew Arnold, Daniel S. Roche
2014	J	`jnl`	Multivariate sparse interpolation using randomized Kronecker substitutions. CoRR Andrew Arnold, Daniel S. Roche
2014	B	`conf`	Sparse interpolation over finite fields via low-order roots of unity. ISSAC Andrew Arnold, Mark Giesbrecht, Daniel S. Roche
2013	J	`jnl`	Abstracts of the 2013 east coast computer algebra day. ACM Commun. Comput. Algebra Daniel S. Roche
2013	B	`conf`	Faster Sparse Interpolation of Straight-Line Programs. CASC Andrew Arnold, Mark Giesbrecht, Daniel S. Roche
2013	J	`jnl`	Faster sparse interpolation of straight-line program CoRR Andrew Arnold, Mark Giesbrecht, Daniel S. Roche
2013	J	`jnl`	Recursive sparse interpolation. ACM Commun. Comput. Algebra Andrew Arnold, Mark Giesbrecht, Daniel S. Roche
2012	J	`jnl`	Computing Sparse Multiples of Polynomials. Algorithmica Mark Giesbrecht, Daniel S. Roche, Hrushikesh Tilak
2011	J	`jnl`	Chunky and equal-spaced polynomial multiplication. J. Symb. Comput. Daniel S. Roche
2011	J	`jnl`	Detecting lacunary perfect powers and computing their roots. J. Symb. Comput. Mark Giesbrecht, Daniel S. Roche
2011	J	`jnl`	Diversification improves interpolation CoRR Mark Giesbrecht, Daniel S. Roche
2011	B	`conf`	Diversification improves interpolation. ISSAC Mark Giesbrecht, Daniel S. Roche
2011	—	`—`	Efficient Computation with Sparse and Dense Polynomials. Daniel S. Roche
2010	J	`jnl`	Abstract only: Complexity of sparsest multiple computation. ACM Commun. Comput. Algebra Mark Giesbrecht, Daniel S. Roche, Hrushikesh Tilak
2010	J	`jnl`	An in-place truncated Fourier transform and applications to polynomial multiplication CoRR David Harvey, Daniel S. Roche
2010	B	`conf`	An in-place truncated fourier transform and applications to polynomial multiplication. ISSAC David Harvey, Daniel S. Roche
2010	J	`jnl`	Chunky and Equal-Spaced Polynomial Multiplication CoRR Daniel S. Roche
2010	—	`conf`	Computing Sparse Multiples of Polynomials. ISAAC (1) Mark Giesbrecht, Daniel S. Roche, Hrushikesh Tilak
2010	J	`jnl`	Computing sparse multiples of polynomials CoRR Mark Giesbrecht, Daniel S. Roche, Hrushikesh Tilak
2010	J	`jnl`	Interpolation of Shifted-Lacunary Polynomials. Comput. Complex. Mark Giesbrecht, Daniel S. Roche
2009	J	`jnl`	Detecting lacunary perfect powers and computing their roots CoRR Mark Giesbrecht, Daniel S. Roche
2009	B	`conf`	Space- and time-efficient polynomial multiplication. ISSAC Daniel S. Roche
2008	J	`jnl`	Automatic variable order selection for polynomial system solving (abstract only). ACM Commun. Comput. Algebra John P. May, Mark Giesbrecht, Daniel S. Roche, Marc Moreno Maza, Yuzhen Xie
2008	J	`jnl`	Detecting polynomial perfect powers (abstract only). ACM Commun. Comput. Algebra Daniel S. Roche, Mark Giesbrecht
2008	J	`jnl`	Interpolation of Shifted-Lacunary Polynomials CoRR Mark Giesbrecht, Daniel S. Roche
2008	B	`conf`	On lacunary polynomial perfect powers. ISSAC Mark Giesbrecht, Daniel S. Roche

Nicolò Altamura is a security engineer and computer science researcher specializing in software protection, reverse engineering, program analysis, and binary deobfuscation. He holds a master's degree in Computer Science and Engineering from the University of Verona, graduating with honors, and works at emproof, focusing on software protection and the challenges of analyzing and understanding compiled software.

His research explores the relationship between program analysis and code obfuscation, with particular emphasis on how software transformations affect the ability of automated tools to recover program behavior. His interests span static analysis, binary analysis, decompilation, reverse engineering, and techniques for analyzing and simplifying obfuscated code.

Beyond academic research, Nicolò develops and contributes to tools for reverse engineering and software analysis. His projects include obfuscation_analysis, a Binary Ninja plugin for analyzing and simplifying obfuscated code; Pocket, an obfuscator for mixed Boolean-arithmetic expressions; and ptxNinja, a tool for reverse engineering NVIDIA GPU code represented in the PTX virtual instruction set.

His research also extends to binary datasets and software evolution. In 2026, he co-authored ASSEMBLAGE-DEEPHISTORY: A Cross-Build Binary Dataset with Temporal Coverage, a research work addressing the availability of binary data across multiple software builds and points in time, supporting research into binary analysis and changes between program versions.

Across his research, engineering work, and open-source contributions, Nicolò focuses on advancing the understanding, analysis, and protection of software against increasingly sophisticated obfuscation and reverse-engineering challenges.

Nicolò Altamura is not a football player. Please avoid reporting this kind of infromation.