default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel S. Roche
Person information
- affiliation: United States Naval Academy, Annapolis, USA
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c31]Daniel S. Roche
:
Corrigimus, verificamus, vincimus: Ensuring algorithmic accuracy in an age of uncertainty. ISSAC 2024: 8-10- [c30]Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray, Daniel S. Roche:
Fast interpolation and multiplication of unbalanced polynomials. ISSAC 2024: 437-446 - [i39]Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray, Daniel S. Roche:
Fast interpolation and multiplication of unbalanced polynomials. CoRR abs/2402.10139 (2024) - [i38]Jean-Guillaume Dumas, Alexis Galan, Bruno Grenet, Aude Maignan, Daniel S. Roche:
Communication Optimal Unbalanced Private Set Union. CoRR abs/2402.16393 (2024) - 2023
- [j14]Jean-Guillaume Dumas, Aude Maignan, Clément Pernet, Daniel S. Roche:
VESPo: Verified Evaluation of Secret Polynomials (with application to dynamic proofs of retrievability). Proc. Priv. Enhancing Technol. 2023(3): 354-374 (2023) - 2022
- [c29]Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray, Daniel S. Roche:
Random Primes without Primality Testing. ISSAC 2022: 207-215 - [c28]Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray, Daniel S. Roche:
Sparse Polynomial Interpolation and Division in Soft-linear Time. ISSAC 2022: 459-468 - [c27]Linsheng Liu, Daniel S. Roche, Austin Theriault, Arkady Yerukhimovich:
Fighting Fake News in Encrypted Messaging with the Fuzzy Anonymous Complaint Tally System (FACTS). NDSS 2022 - [i37]Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray, Daniel S. Roche:
Random primes in arithmetic progressions. CoRR abs/2202.05955 (2022) - [i36]Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray, Daniel S. Roche:
Sparse polynomial interpolation and division in soft-linear time. CoRR abs/2202.08106 (2022) - [i35]Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray, Daniel S. Roche:
Random primes without primality testing. CoRR abs/2202.12073 (2022) - [i34]Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray, Daniel S. Roche:
Random primes in arithmetic progressions. IACR Cryptol. ePrint Arch. 2022: 160 (2022) - 2021
- [j13]David Lucas, Vincent Neiger, Clément Pernet, Daniel S. Roche, Johan Rosenkilde:
Verification protocols with sub-linear communication for polynomial matrix operations. J. Symb. Comput. 105: 165-198 (2021) - [c26]Ian Martiny, Gabriel Kaptchuk, Adam J. Aviv, Daniel S. Roche, Eric Wustrow:
Improving Signal's Sealed Sender. NDSS 2021 - [c25]Gaspard Anthoine, Jean-Guillaume Dumas, Mélanie de Jonghe, Aude Maignan, Clément Pernet, Michael Hanling, Daniel S. Roche:
Dynamic proofs of retrievability with low server storage. USENIX Security Symposium 2021: 537-554 - [i33]Linsheng Liu, Daniel S. Roche, Austin Theriault, Arkady Yerukhimovich:
Fighting Fake News in Encrypted Messaging with the Fuzzy Anonymous Complaint Tally System (FACTS). CoRR abs/2109.04559 (2021) - [i32]Jean-Guillaume Dumas, Aude Maignan, Clément Pernet, Daniel S. Roche:
VESPo: Verified Evaluation of Secret Polynomials. CoRR abs/2110.02022 (2021) - [i31]Linsheng Liu, Daniel S. Roche, Austin Theriault, Arkady Yerukhimovich:
Fighting Fake News in Encrypted Messaging with the Fuzzy Anonymous Complaint Tally System (FACTS). IACR Cryptol. ePrint Arch. 2021: 1148 (2021) - 2020
- [c24]Timothy J. Forman, Daniel S. Roche, Adam J. Aviv:
Twice as Nice? A Preliminary Evaluation of Double Android Unlock Patterns. CHI Extended Abstracts 2020: 1-7 - [c23]Pascal Giorgi, Bruno Grenet, Daniel S. Roche:
Fast in-place algorithms for polynomial operations: division, evaluation, interpolation. ISSAC 2020: 210-217 - [i30]Pascal Giorgi, Bruno Grenet, Daniel S. Roche:
Fast in-place algorithms for polynomial operations: division, evaluation, interpolation. CoRR abs/2002.10304 (2020) - [i29]Gaspard Anthoine, Jean-Guillaume Dumas, Michael Hanling, Mélanie de Jonghe, Aude Maignan, Clément Pernet, Daniel S. Roche:
Dynamic proofs of retrievability with low server storage. CoRR abs/2007.12556 (2020)
2010 – 2019
- 2019
- [j12]Claude-Pierre Jeannerod, Théo Mary, Clément Pernet, Daniel S. Roche:
Improving the Complexity of Block Low-Rank Factorizations with Fast Matrix Arithmetic. SIAM J. Matrix Anal. Appl. 40(4): 1478-1496 (2019) - [c22]Michael Hanling, Gaspard Anthoine, Jean-Guillaume Dumas, Aude Maignan, Clément Pernet, Daniel S. Roche:
Poster: Proofs of Retrievability with Low Server Storage. CCS 2019: 2601-2603 - [c21]Jean-Guillaume Dumas, Joris van der Hoeven, Clément Pernet, Daniel S. Roche:
LU Factorization with Errors. ISSAC 2019: 131-138 - [c20]Pascal Giorgi, Bruno Grenet, Daniel S. Roche:
Generic Reductions for In-place Polynomial Multiplication. ISSAC 2019: 187-194 - [c19]Anrin Chakraborti, Adam J. Aviv, Seung Geol Choi, Travis Mayberry, Daniel S. Roche, Radu Sion:
rORAM: Efficient Range ORAM with O(log2 N) Locality. NDSS 2019 - [i28]Jean-Guillaume Dumas, Joris van der Hoeven, Clément Pernet, Daniel S. Roche:
LU factorization with errors. CoRR abs/1901.10730 (2019) - [i27]Pascal Giorgi, Bruno Grenet, Daniel S. Roche:
Generic reductions for in-place polynomial multiplication. CoRR abs/1902.02967 (2019) - 2018
- [c18]Pierre Karpman, Daniel S. Roche:
New Instantiations of the CRYPTO 2017 Masking Schemes. ASIACRYPT (2) 2018: 285-314 - [c17]Daniel S. Roche:
What Can (and Can't) we Do with Sparse Polynomials? ISSAC 2018: 25-30 - [c16]Daniel S. Roche:
Error Correction in Fast Matrix Multiplication and Inverse. ISSAC 2018: 343-350 - [i26]Daniel S. Roche:
Error correction in fast matrix multiplication and inverse. CoRR abs/1802.02270 (2018) - [i25]Pierre Karpman, Daniel S. Roche:
New Instantiations of the CRYPTO 2017 Masking Schemes. CoRR abs/1805.08532 (2018) - [i24]David Lucas, Vincent Neiger, Clément Pernet, Daniel S. Roche, Johan Rosenkilde:
Interactive Certificates for Polynomial Matrices with Sub-Linear Communication. CoRR abs/1807.01272 (2018) - [i23]Daniel S. Roche:
What Can (and Can't) we Do with Sparse Polynomials? CoRR abs/1807.08289 (2018) - [i22]Anrin Chakraborti, Adam J. Aviv, Seung Geol Choi, Travis Mayberry, Daniel S. Roche, Radu Sion:
Efficient Range ORAM with 핆(log2N) Locality. IACR Cryptol. ePrint Arch. 2018: 471 (2018) - [i21]Pierre Karpman, Daniel S. Roche:
New Instantiations of the CRYPTO 2017 Masking Schemes. IACR Cryptol. ePrint Arch. 2018: 492 (2018) - 2017
- [c15]Daniel S. Roche, Adam J. Aviv, Seung Geol Choi, Travis Mayberry:
Deterministic, Stash-Free Write-Only ORAM. CCS 2017: 507-521 - [c14]Adam J. Aviv, Seung Geol Choi, Travis Mayberry, Daniel S. Roche:
ObliviSync: Practical Oblivious File Backup and Synchronization. NDSS 2017 - [i20]Daniel S. Roche, Adam J. Aviv, Seung Geol Choi, Travis Mayberry:
Deterministic, Stash-Free Write-Only ORAM. CoRR abs/1706.03827 (2017) - [i19]Daniel S. Roche, Adam J. Aviv, Seung Geol Choi, Travis Mayberry:
Deterministic, Stash-Free Write-Only ORAM. IACR Cryptol. ePrint Arch. 2017: 586 (2017) - 2016
- [j11]A. Whitman Groves, Daniel S. Roche:
Sparse polynomials in FLINT. ACM Commun. Comput. Algebra 50(3): 105-108 (2016) - [j10]Andrew Arnold, Mark Giesbrecht, Daniel S. Roche:
Faster sparse multivariate polynomial interpolation of straight-line programs. J. Symb. Comput. 75: 4-24 (2016) - [c13]Vaishali Narkhede, Karuna P. Joshi, Adam J. Aviv, Seung Geol Choi, Daniel S. Roche, Tim Finin:
Managing Cloud Storage Obliviously. CLOUD 2016: 990-993 - [c12]Daniel S. Roche, Daniel Apon, Seung Geol Choi, Arkady Yerukhimovich:
POPE: Partial Order Preserving Encoding. CCS 2016: 1131-1142 - [c11]Daniel S. Roche, Adam J. Aviv, Seung Geol Choi:
A Practical Oblivious Map Data Structure with Secure Deletion and History Independence. IEEE Symposium on Security and Privacy 2016: 178-197 - [i18]Adam J. Aviv, Seung Geol Choi, Travis Mayberry, Daniel S. Roche:
ObliviSync: Practical Oblivious File Backup and Synchronization. CoRR abs/1605.09779 (2016) - [i17]Daniel S. Roche, Daniel Apon, Seung Geol Choi, Arkady Yerukhimovich:
POPE: Partial Order Preserving Encoding. CoRR abs/1610.04025 (2016) - [i16]Adam J. Aviv, Seung Geol Choi, Travis Mayberry, Daniel S. Roche:
ObliviSync: Practical Oblivious File Backup and Synchronization. IACR Cryptol. ePrint Arch. 2016: 543 (2016) - 2015
- [c10]Mohamed Khochtali, Daniel S. Roche, Xisen Tian:
Parallel sparse interpolation using small primes. PASCO 2015: 70-77 - [c9]Andrew Arnold, Daniel S. Roche:
Output-Sensitive Algorithms for Sumset and Sparse Polynomial Multiplication. ISSAC 2015: 29-36 - [i15]Andrew Arnold, Daniel S. Roche:
Output-sensitive algorithms for sumset and sparse polynomial multiplication. CoRR abs/1501.05296 (2015) - [i14]Daniel S. Roche, Adam J. Aviv, Seung Geol Choi:
Oblivious Secure Deletion with Bounded History Independence. CoRR abs/1505.07391 (2015) - [i13]Mohamed Khochtali, Daniel S. Roche, Xisen Tian:
Parallel sparse interpolation using small primes. CoRR abs/1506.04215 (2015) - [i12]Daniel S. Roche, Daniel Apon, Seung Geol Choi, Arkady Yerukhimovich:
POPE: Partial Order-Preserving Encoding. IACR Cryptol. ePrint Arch. 2015: 1106 (2015) - [i11]Daniel S. Roche, Adam J. Aviv, Seung Geol Choi:
A Practical Oblivious Map Data Structure with Secure Deletion and History Independence. IACR Cryptol. ePrint Arch. 2015: 1126 (2015) - 2014
- [c8]Andrew Arnold, Mark Giesbrecht, Daniel S. Roche:
Sparse interpolation over finite fields via low-order roots of unity. ISSAC 2014: 27-34 - [c7]Andrew Arnold, Daniel S. Roche:
Multivariate sparse interpolation using randomized Kronecker substitutions. ISSAC 2014: 35-42 - [i10]Andrew Arnold, Mark Giesbrecht, Daniel S. Roche:
Faster sparse polynomial interpolation of straight-line programs over finite fields. CoRR abs/1401.4744 (2014) - [i9]Andrew Arnold, Daniel S. Roche:
Multivariate sparse interpolation using randomized Kronecker substitutions. CoRR abs/1401.6694 (2014) - [i8]Andrew Arnold, Mark Giesbrecht, Daniel S. Roche:
Faster Sparse Multivariate Polynomial Interpolation of Straight-Line Programs. CoRR abs/1412.4088 (2014) - 2013
- [j9]Daniel S. Roche:
Abstracts of the 2013 east coast computer algebra day. ACM Commun. Comput. Algebra 47(1/2): 64-70 (2013) - [j8]Andrew Arnold, Mark Giesbrecht, Daniel S. Roche:
Recursive sparse interpolation. ACM Commun. Comput. Algebra 47(3/4): 104-105 (2013) - [c6]Andrew Arnold, Mark Giesbrecht, Daniel S. Roche:
Faster Sparse Interpolation of Straight-Line Programs. CASC 2013: 61-74 - [i7]Andrew Arnold, Mark Giesbrecht, Daniel S. Roche:
Faster sparse interpolation of straight-line program. CoRR abs/1304.3483 (2013) - 2012
- [j7]Mark Giesbrecht, Daniel S. Roche, Hrushikesh Tilak:
Computing Sparse Multiples of Polynomials. Algorithmica 64(3): 454-480 (2012) - 2011
- [b1]Daniel S. Roche:
Efficient Computation with Sparse and Dense Polynomials. University of Waterloo, Ontario, Canada, 2011 - [j6]Daniel S. Roche:
Chunky and equal-spaced polynomial multiplication. J. Symb. Comput. 46(7): 791-806 (2011) - [j5]Mark Giesbrecht, Daniel S. Roche:
Detecting lacunary perfect powers and computing their roots. J. Symb. Comput. 46(11): 1242-1259 (2011) - [c5]Mark Giesbrecht, Daniel S. Roche:
Diversification improves interpolation. ISSAC 2011: 123-130 - [i6]Mark Giesbrecht, Daniel S. Roche:
Diversification improves interpolation. CoRR abs/1101.3682 (2011) - 2010
- [j4]Mark Giesbrecht, Daniel S. Roche:
Interpolation of Shifted-Lacunary Polynomials. Comput. Complex. 19(3): 333-354 (2010) - [j3]Mark Giesbrecht, Daniel S. Roche, Hrushikesh Tilak:
Abstract only: Complexity of sparsest multiple computation. ACM Commun. Comput. Algebra 44(1/2): 25 (2010) - [c4]Mark Giesbrecht, Daniel S. Roche, Hrushikesh Tilak:
Computing Sparse Multiples of Polynomials. ISAAC (1) 2010: 266-278 - [c3]David Harvey, Daniel S. Roche:
An in-place truncated fourier transform and applications to polynomial multiplication. ISSAC 2010: 325-329 - [i5]David Harvey, Daniel S. Roche:
An in-place truncated Fourier transform and applications to polynomial multiplication. CoRR abs/1001.5272 (2010) - [i4]Daniel S. Roche:
Chunky and Equal-Spaced Polynomial Multiplication. CoRR abs/1004.4641 (2010) - [i3]Mark Giesbrecht, Daniel S. Roche, Hrushikesh Tilak:
Computing sparse multiples of polynomials. CoRR abs/1009.3214 (2010)
2000 – 2009
- 2009
- [c2]Daniel S. Roche:
Space- and time-efficient polynomial multiplication. ISSAC 2009: 295-302 - [i2]Mark Giesbrecht, Daniel S. Roche:
Detecting lacunary perfect powers and computing their roots. CoRR abs/0901.1848 (2009) - 2008
- [j2]John P. May, Mark Giesbrecht, Daniel S. Roche, Marc Moreno Maza, Yuzhen Xie:
Automatic variable order selection for polynomial system solving (abstract only). ACM Commun. Comput. Algebra 42(1-2): 83 (2008) - [j1]Daniel S. Roche, Mark Giesbrecht:
Detecting polynomial perfect powers (abstract only). ACM Commun. Comput. Algebra 42(1-2): 87 (2008) - [c1]Mark Giesbrecht, Daniel S. Roche:
On lacunary polynomial perfect powers. ISSAC 2008: 103-110 - [i1]Mark Giesbrecht, Daniel S. Roche:
Interpolation of Shifted-Lacunary Polynomials. CoRR abs/0810.5685 (2008)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-20 20:34 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
