Daniel S. Roche
Daniel S. Roche
Associate Professor of Computer Science, United States Naval Academy
Bestätigte E-Mail-Adresse bei usna.edu - Startseite
Titel
Zitiert von
Zitiert von
Jahr
POPE: Partial order preserving encoding
DS Roche, D Apon, SG Choi, A Yerukhimovich
Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications …, 2016
472016
A practical oblivious map data structure with secure deletion and history independence
DS Roche, A Aviv, SG Choi
2016 IEEE Symposium on Security and Privacy (SP), 178-197, 2016
332016
Diversification improves interpolation
M Giesbrecht, DS Roche
Proceedings of the 36th international symposium on Symbolic and algebraic …, 2011
332011
Interpolation of shifted-lacunary polynomials
M Giesbrecht, DS Roche
Computational Complexity 19 (3), 333-354, 2010
312010
Interpolation of shifted-lacunary polynomials
M Giesbrecht, DS Roche
Computational Complexity 19 (3), 333-354, 2010
312010
An in-place truncated fourier transform and applications to polynomial multiplication
D Harvey, DS Roche
Proceedings of the 2010 International Symposium on Symbolic and Algebraic …, 2010
292010
Faster sparse multivariate polynomial interpolation of straight-line programs
A Arnold, M Giesbrecht, DS Roche
Journal of Symbolic Computation 75, 4-24, 2016
232016
Multivariate sparse interpolation using randomized Kronecker substitutions
A Arnold, DS Roche
Proceedings of the 39th International Symposium on Symbolic and Algebraic …, 2014
232014
Space-and time-efficient polynomial multiplication
DS Roche
Proceedings of the 2009 international symposium on Symbolic and algebraic …, 2009
212009
Sparse interpolation over finite fields via low-order roots of unity
A Arnold, M Giesbrecht, DS Roche
arXiv preprint arXiv:1401.4744, 2014
202014
Faster sparse interpolation of straight-line programs
A Arnold, M Giesbrecht, DS Roche
International Workshop on Computer Algebra in Scientific Computing, 61-74, 2013
192013
Output-sensitive algorithms for sumset and sparse polynomial multiplication
A Arnold, DS Roche
Proceedings of the 2015 ACM on International Symposium on Symbolic and …, 2015
172015
Deterministic, stash-free write-only oram
DS Roche, A Aviv, SG Choi, T Mayberry
Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications …, 2017
122017
Detecting lacunary perfect powers and computing their roots
M Giesbrecht, DS Roche
Journal of Symbolic Computation 46 (11), 1242-1259, 2011
102011
Chunky and equal-spaced polynomial multiplication
DS Roche
Journal of Symbolic Computation 46 (7), 791-806, 2011
102011
What Can (and Can't) we Do with Sparse Polynomials?
DS Roche
Proceedings of the 2018 ACM International Symposium on Symbolic and …, 2018
92018
Semantically rich, oblivious access control using abac for secure cloud storage
M Joshi, S Mittal, KP Joshi, T Finin
2017 IEEE international conference on edge computing (EDGE), 142-149, 2017
82017
Oblivisync: Practical oblivious file backup and synchronization
AJ Aviv, SG Choi, T Mayberry, DS Roche
arXiv preprint arXiv:1605.09779, 2016
72016
On lacunary polynomial perfect powers
M Giesbrecht, DS Roche
Proceedings of the twenty-first international symposium on Symbolic and …, 2008
72008
Efficient Computation with Sparse and Dense Polynomials
DS Roche
University of Waterloo, 2011
52011
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20