Divesh Aggarwal and Chandan Dubey
Improved hardness results for unique shortest vector problem
In submission, 2012.
Available files:
[ Abstract ]
[ BibTeX ]
Divesh Aggarwal, Ueli Maurer, and Igor Shparlinski
The Equivalence of Strong RSA and Factoring in the Generic Ring Model of Computation.
Workshop on Coding and Cryptography - WCC 2011, INRIA, vol. inria00607256, version 1, Jul 2011.
Available files:
[ PDF ]
[ Abstract ]
[ BibTeX ]
Divesh Aggarwal and Ueli Maurer
The Leakage-Resilience Limit of a Computational Problem is Equal to its Unpredictability Entropy
Advances in Cryptology - Asiacrypt 2011, Lecture Notes in Computer Science, Springer-Verlag, vol. 7073, pp. 686-701, 2011.
Available files:
[ PDF ]
[ Abstract ]
[ BibTeX ]
Divesh Aggarwal and Ueli Maurer
Breaking RSA Generically is Equivalent to Factoring
Advances in Cryptology - EUROCRYPT 2009, Lecture Notes in Computer Science, Springer-Verlag, vol. 5479, pp. 36-53, Apr 2009.
Available files:
[ PDF ]
[ Abstract ]
[ BibTeX ]
Divesh Aggarwal, Chandan Dubey, and Shashank Mehta
Algorithms on Graphs with Small Dominating Targets.
Algorithms and Computation, 17th International Symposium, ISAAC 2006, Lecture Notes in Computer Science, Springer, vol. 4288, pp. 141-152, Dec 2006.
Available files:
[ PDF ]
[ Abstract ]
[ BibTeX ]
Divesh Aggarwal, Shashank Mehta, and Jitender Deogun
Domination Search on Graphs with Low Dominating-Target-Number
Graph-Theoretic Concepts in Computer Science, WG 2005, Lecture Notes in Computer Science, Springer, vol. 3787, pp. 28-37, Jun 2005.
Available files:
[ PDF ]
[ Abstract ]
[ BibTeX ]
- Home
- Mission
- Research ⊕
- Publications
- Teaching ⊕
- People ⊗
- Events ⊕
- Links