default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDivesh Aggarwal
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j12]Divesh Aggarwal, Naresh Goud Boddu
, Rahul Jain, Maciej Obremski:
Quantum Measurement Adversary. IEEE Trans. Inf. Theory 70(1): 318-335 (2024)- [j11]Divesh Aggarwal, Naresh Goud Boddu, Rahul Jain:
Quantum Secure Non-Malleable Codes in the Split-State Model. IEEE Trans. Inf. Theory 70(1): 349-371 (2024) - [e1]Divesh Aggarwal:
5th Conference on Information-Theoretic Cryptography, ITC 2024, August 14-16, 2024, Stanford, CA, USA. LIPIcs 304, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2024, ISBN 978-3-95977-333-1 [contents] - [i59]Divesh Aggarwal, Antoine Joux, Miklos Santha, Karol Wegrzycki:
Polynomial Time Algorithms for Integer Programming and Unbounded Subset Sum in the Total Regime. CoRR abs/2407.05435 (2024) - [i58]Mate Soos, Uddalok Sarkar, Divesh Aggarwal, Sourav Chakraborty, Kuldeep S. Meel, Maciej Obremski:
Engineering an Efficient Approximate DNF-Counter. CoRR abs/2407.19946 (2024) - [i57]Divesh Aggarwal, Pranjal Dutta, Zeyong Li, Maciej Obremski, Sidhant Saraogi:
Improved Lower Bounds for 3-Query Matching Vector Codes. Electron. Colloquium Comput. Complex. TR24 (2024) - [i56]Divesh Aggarwal, Leong Jin Ming, Alexandra Veliche:
Worst-Case to Average-Case Hardness of LWE: A Simple and Practical Perspective. Electron. Colloquium Comput. Complex. TR24 (2024) - [i55]Divesh Aggarwal, Leong Jin Ming, Alexandra Veliche:
Worst-Case to Average-Case Hardness of LWE: A Simple and Practical Perspective. IACR Cryptol. ePrint Arch. 2024: 603 (2024) - 2023
- [j10]Divesh Aggarwal, Nico Döttling, Jesko Dujmovic, Mohammad Hajiabadi, Giulio Malavolta, Maciej Obremski:
Algebraic Restriction Codes and Their Applications. Algorithmica 85(12): 3602-3648 (2023) - [c39]Teodora Baluta, Ivica Nikolic, Racchit Jain, Divesh Aggarwal, Prateek Saxena:
Unforgeability in Stochastic Gradient Descent. CCS 2023: 1138-1152 - [c38]Divesh Aggarwal, Eldon Chung, Maciej Obremski:
Extractors: Low Entropy Requirements Colliding with Non-malleability. CRYPTO (2) 2023: 580-610 - [c37]Divesh Aggarwal, Rajendra Kumar:
Why we couldn't prove SETH hardness of the Closest Vector Problem for even norms! FOCS 2023: 2213-2230 - [c36]Mate Soos, Divesh Aggarwal, Sourav Chakraborty, Kuldeep S. Meel, Maciej Obremski:
Engineering an Efficient Approximate DNF-Counter. IJCAI 2023: 2031-2038 - [c35]Divesh Aggarwal, Huck Bennett, Zvika Brakerski, Alexander Golovnev, Rajendra Kumar, Zeyong Li, Spencer Peters, Noah Stephens-Davidowitz, Vinod Vaikuntanathan:
Lattice Problems beyond Polynomial Time. STOC 2023: 1516-1526 - [i54]Divesh Aggarwal, Thomas Espitau, Spencer Peters, Noah Stephens-Davidowitz:
Recursive lattice reduction - A framework for finding short lattice vectors. CoRR abs/2311.15064 (2023) - 2022
- [j9]Divesh Aggarwal, Marshall Ball, Maciej Obremski:
Non-Malleable Code in the Split-State Model. Entropy 24(8): 1038 (2022) - [j8]Divesh Aggarwal, Maciej Obremski, João Ribeiro, Mark Simkin, Luisa Siniscalchi:
Privacy Amplification With Tamperable Memory via Non-Malleable Two-Source Extractors. IEEE Trans. Inf. Theory 68(8): 5475-5495 (2022) - [c34]Divesh Aggarwal, Nico Döttling, Jesko Dujmovic, Mohammad Hajiabadi, Giulio Malavolta, Maciej Obremski:
Algebraic Restriction Codes and Their Applications. ITCS 2022: 2:1-2:15 - [c33]Divesh Aggarwal, Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu, Maciej Obremski, Sruthi Sekar:
Rate one-third non-malleable codes. STOC 2022: 1364-1377 - [c32]Divesh Aggarwal, Eldon Chung, Maciej Obremski, João Ribeiro:
On Secret Sharing, Randomness, and Random-less Reductions for Secret Sharing. TCC (1) 2022: 327-354 - [i53]Divesh Aggarwal, Rajendra Kumar:
Why we couldn't prove SETH hardness of the Closest Vector Problem for even norms, and of the Subset Sum Problem! CoRR abs/2211.04385 (2022) - [i52]Divesh Aggarwal, Huck Bennett, Zvika Brakerski, Alexander Golovnev, Rajendra Kumar, Zeyong Li, Spencer Peters, Noah Stephens-Davidowitz, Vinod Vaikuntanathan:
Lattice Problems Beyond Polynomial Time. CoRR abs/2211.11693 (2022) - [i51]Divesh Aggarwal, Marshall Ball, Maciej Obremski:
Survey: Non-malleable code in the split-state model. IACR Cryptol. ePrint Arch. 2022: 1326 (2022) - 2021
- [j7]Divesh Aggarwal, Eldon Chung:
A note on the concrete hardness of the shortest independent vector in lattices. Inf. Process. Lett. 167: 106065 (2021) - [c31]Divesh Aggarwal, Zeyong Li, Noah Stephens-Davidowitz:
A 2n/2-Time Algorithm for $\sqrt{n}$-SVP and $\sqrt{n}$-Hermite SVP, and an Improved Time-Approximation Tradeoff for (H)SVP. EUROCRYPT (1) 2021: 467-497 - [c30]Divesh Aggarwal, Huck Bennett, Alexander Golovnev, Noah Stephens-Davidowitz:
Fine-grained hardness of CVP(P) - Everything that we can prove (and nothing else). SODA 2021: 1816-1835 - [c29]Divesh Aggarwal, Yanlin Chen, Rajendra Kumar, Zeyong Li, Noah Stephens-Davidowitz:
Dimension-Preserving Reductions Between SVP and CVP in Different p-Norms. SODA 2021: 2444-2462 - [c28]Divesh Aggarwal, Yanlin Chen, Rajendra Kumar, Yixin Shen:
Improved (Provable) Algorithms for the Shortest Vector Problem via Bounded Distance Decoding. STACS 2021: 4:1-4:20 - [i50]Divesh Aggarwal, Yanlin Chen, Rajendra Kumar, Zeyong Li, Noah Stephens-Davidowitz:
Dimension-Preserving Reductions Between SVP and CVP in Different p-Norms. CoRR abs/2104.06576 (2021) - [i49]Divesh Aggarwal, Naresh Goud Boddu, Rahul Jain, Maciej Obremski:
Quantum Measurement Adversary. CoRR abs/2106.02766 (2021) - [i48]Eldon Chung, Maciej Obremski, Divesh Aggarwal:
Extractors: Low Entropy Requirements Colliding With Non-Malleability. CoRR abs/2111.04157 (2021) - [i47]Divesh Aggarwal, Eldon Chung, Maciej Obremski, João Ribeiro:
On Secret Sharing, Randomness, and Random-less Reductions for Secret Sharing. Electron. Colloquium Comput. Complex. TR21 (2021) - [i46]Divesh Aggarwal, Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu, Maciej Obremski, Sruthi Sekar:
Simplicity Meets Near-Optimal Rate: Non-malleable Codes and Non-malleable Two-source Extractors via Rate Boosters. Electron. Colloquium Comput. Complex. TR21 (2021) - [i45]Eldon Chung, Maciej Obremski, Divesh Aggarwal:
Extractors: Low Entropy Requirements Colliding With Non-Malleability. Electron. Colloquium Comput. Complex. TR21 (2021) - [i44]Divesh Aggarwal, Eldon Chung, Maciej Obremski, João Ribeiro:
On Secret Sharing, Randomness, and Random-less Reductions for Secret Sharing. IACR Cryptol. ePrint Arch. 2021: 802 (2021) - [i43]Divesh Aggarwal, Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu, Maciej Obremski, Sruthi Sekar:
Rate One-Third Non-malleable Codes. IACR Cryptol. ePrint Arch. 2021: 1042 (2021) - [i42]Divesh Aggarwal, Nico Döttling, Jesko Dujmovic, Mohammad Hajiabadi, Giulio Malavolta, Maciej Obremski:
Algebraic Restriction Codes and their Applications. IACR Cryptol. ePrint Arch. 2021: 1177 (2021) - [i41]Eldon Chung, Maciej Obremski, Divesh Aggarwal:
Extractors: Low Entropy Requirements Colliding With Non-Malleability. IACR Cryptol. ePrint Arch. 2021: 1480 (2021) - 2020
- [c27]Divesh Aggarwal, Siyao Guo, Maciej Obremski, João Ribeiro, Noah Stephens-Davidowitz:
Extractor Lower Bounds, Revisited. APPROX-RANDOM 2020: 1:1-1:20 - [c26]Divesh Aggarwal, Jianwei Li, Phong Q. Nguyen, Noah Stephens-Davidowitz:
Slide Reduction, Revisited - Filling the Gaps in SVP Approximation. CRYPTO (2) 2020: 274-295 - [c25]Divesh Aggarwal, Maciej Obremski, João Ribeiro, Luisa Siniscalchi, Ivan Visconti:
How to Extract Useful Randomness from Unreliable Sources. EUROCRYPT (1) 2020: 343-372 - [c24]Divesh Aggarwal, Maciej Obremski:
A constant rate non-malleable code in the split-state model. FOCS 2020: 1285-1294 - [i40]Divesh Aggarwal, Yanlin Chen, Rajendra Kumar, Yixin Shen:
Improved (Provable) Algorithms for the Shortest Vector Problem via Bounded Distance Decoding. CoRR abs/2002.07955 (2020) - [i39]Divesh Aggarwal, Eldon Chung:
A Note on the Concrete Hardness of the Shortest Independent Vectors Problem in Lattices. CoRR abs/2005.11654 (2020) - [i38]Divesh Aggarwal, Zeyong Li, Noah Stephens-Davidowitz:
A 2n/2-Time Algorithm for √n-SVP and √n-Hermite SVP, and an Improved Time-Approximation Tradeoff for (H)SVP. CoRR abs/2007.09556 (2020) - [i37]Divesh Aggarwal, Maciej Obremski, João Ribeiro, Mark Simkin, Luisa Siniscalchi:
Computational and Information-Theoretic Two-Source (Non-Malleable) Extractors. IACR Cryptol. ePrint Arch. 2020: 259 (2020) - [i36]Divesh Aggarwal, Maciej Obremski, João Ribeiro, Mark Simkin, Luisa Siniscalchi:
Two-Source Non-Malleable Extractors and Applications to Privacy Amplification with Tamperable Memory. IACR Cryptol. ePrint Arch. 2020: 1371 (2020)
2010 – 2019
- 2019
- [c23]Divesh Aggarwal, Ivan Damgård, Jesper Buus Nielsen, Maciej Obremski, Erick Purwanto, João Ribeiro, Mark Simkin:
Stronger Leakage-Resilient and Non-Malleable Secret Sharing Schemes for General Access Structures. CRYPTO (2) 2019: 510-539 - [c22]Divesh Aggarwal, Kai-Min Chung, Han-Hsuan Lin, Thomas Vidick:
A Quantum-Proof Non-malleable Extractor - With Application to Privacy Amplification Against Active Quantum Adversaries. EUROCRYPT (2) 2019: 442-469 - [c21]Divesh Aggarwal, Nico Döttling, Jesper Buus Nielsen, Maciej Obremski, Erick Purwanto:
Continuous Non-Malleable Codes in the 8-Split-State Model. EUROCRYPT (1) 2019: 531-561 - [i35]Divesh Aggarwal, Jianwei Li, Phong Q. Nguyen, Noah Stephens-Davidowitz:
Slide Reduction, Revisited - Filling the Gaps in SVP Approximation. CoRR abs/1908.03724 (2019) - [i34]Divesh Aggarwal, Huck Bennett, Alexander Golovnev, Noah Stephens-Davidowitz:
Fine-grained hardness of CVP(P) - Everything that we can prove (and nothing else). CoRR abs/1911.02440 (2019) - [i33]Divesh Aggarwal, Siyao Guo, Maciej Obremski, João Ribeiro, Noah Stephens-Davidowitz:
Extractor Lower Bounds, Revisited. Electron. Colloquium Comput. Complex. TR19 (2019) - [i32]Divesh Aggarwal, Kai-Min Chung, Han-Hsuan Lin, Thomas Vidick:
A Quantum-Proof Non-Malleable Extractor With Application to Privacy Amplification against Active Quantum Adversaries. IACR Cryptol. ePrint Arch. 2019: 254 (2019) - [i31]Divesh Aggarwal, Maciej Obremski:
Inception makes non-malleable codes shorter as well! IACR Cryptol. ePrint Arch. 2019: 399 (2019) - [i30]Divesh Aggarwal, Bogdan Ursu, Serge Vaudenay:
Faster Sieving Algorithm for Approximate SVP with Constant Approximation Factors. IACR Cryptol. ePrint Arch. 2019: 1028 (2019) - [i29]Divesh Aggarwal, Maciej Obremski, João Ribeiro, Luisa Siniscalchi, Ivan Visconti:
How to Extract Useful Randomness from Unreliable Sources. IACR Cryptol. ePrint Arch. 2019: 1156 (2019) - [i28]Divesh Aggarwal, Maciej Obremski:
A constant-rate non-malleable code in the split-state model. IACR Cryptol. ePrint Arch. 2019: 1299 (2019) - 2018
- [j6]Divesh Aggarwal, Gavin K. Brennen, Troy Lee, Miklos Santha, Marco Tomamichel:
Quantum Attacks on Bitcoin, and How to Protect Against Them. Ledger 3 (2018) - [j5]Divesh Aggarwal, Yevgeniy Dodis, Shachar Lovett:
Non-Malleable Codes from Additive Combinatorics. SIAM J. Comput. 47(2): 524-546 (2018) - [c20]Divesh Aggarwal, Antoine Joux, Anupam Prakash, Miklos Santha:
A New Public-Key Cryptosystem via Mersenne Numbers. CRYPTO (3) 2018: 459-482 - [c19]Divesh Aggarwal, Priyanka Mukhopadhyay:
Improved Algorithms for the Shortest Vector Problem and the Closest Vector Problem in the Infinity Norm. ISAAC 2018: 35:1-35:13 - [c18]Divesh Aggarwal, Tomasz Kazana, Maciej Obremski:
Leakage-Resilient Algebraic Manipulation Detection Codes with Optimal Parameters. ISIT 2018: 1131-1135 - [c17]Divesh Aggarwal, Noah Stephens-Davidowitz:
Just Take the Average! An Embarrassingly Simple 2^n-Time Algorithm for SVP (and CVP). SOSA 2018: 12:1-12:19 - [c16]Divesh Aggarwal, Noah Stephens-Davidowitz:
(Gap/S)ETH hardness of SVP. STOC 2018: 228-238 - [i27]Divesh Aggarwal, Priyanka Mukhopadhyay:
Faster algorithms for SVP and CVP in the 𝓁∞ norm. CoRR abs/1801.02358 (2018) - [i26]Divesh Aggarwal, Tomasz Kazana, Maciej Obremski:
Leakage-resilient Algebraic Manipulation Detection Codes with Optimal Parameters. IACR Cryptol. ePrint Arch. 2018: 58 (2018) - [i25]Divesh Aggarwal, Ivan Damgård, Jesper Buus Nielsen, Maciej Obremski, Erick Purwanto, João Ribeiro, Mark Simkin:
Stronger Leakage-Resilient and Non-Malleable Secret-Sharing Schemes for General Access Structures. IACR Cryptol. ePrint Arch. 2018: 1147 (2018) - 2017
- [c15]Divesh Aggarwal, Tomasz Kazana, Maciej Obremski:
Inception Makes Non-malleable Codes Stronger. TCC (2) 2017: 319-343 - [i24]Divesh Aggarwal, Noah Stephens-Davidowitz:
Just Take the Average! An Embarrassingly Simple $2^n$-Time Algorithm for SVP (and CVP). CoRR abs/1709.01535 (2017) - [i23]Divesh Aggarwal, Kai-Min Chung, Han-Hsuan Lin, Thomas Vidick:
A Quantum-Proof Non-Malleable Extractor, With Application to Privacy Amplification against Active Quantum Adversaries. CoRR abs/1710.00557 (2017) - [i22]Divesh Aggarwal, Noah Stephens-Davidowitz:
(Gap/S)ETH Hardness of SVP. CoRR abs/1712.00942 (2017) - [i21]Divesh Aggarwal, Antoine Joux, Anupam Prakash, Miklos Santha:
A New Public-Key Cryptosystem via Mersenne Numbers. IACR Cryptol. ePrint Arch. 2017: 481 (2017) - 2016
- [j4]Divesh Aggarwal, Oded Regev:
A Note on Discrete Gaussian Combinations of Lattice Vectors. Chic. J. Theor. Comput. Sci. 2016 (2016) - [j3]Divesh Aggarwal, Chandan K. Dubey:
Improved hardness results for unique shortest vector problem. Inf. Process. Lett. 116(10): 631-637 (2016) - [j2]Divesh Aggarwal, Ueli Maurer:
Breaking RSA Generically Is Equivalent to Factoring. IEEE Trans. Inf. Theory 62(11): 6251-6259 (2016) - [c14]Divesh Aggarwal, Jop Briët:
Revisiting the Sanders-Bogolyubov-Ruzsa theorem in Fpn and its application to non-malleable codes. ISIT 2016: 1322-1326 - [c13]Divesh Aggarwal, Kaave Hosseini, Shachar Lovett:
Affine-malleable extractors, spectrum doubling, and application to privacy amplification. ISIT 2016: 2913-2917 - [c12]Divesh Aggarwal, Shashank Agrawal, Divya Gupta, Hemanta K. Maji, Omkant Pandey, Manoj Prabhakaran:
Optimal Computational Split-state Non-malleable Codes. TCC (A2) 2016: 393-417 - [i20]Divesh Aggarwal, Jop Briët:
Revisiting the Sanders-Freiman-Ruzsa Theorem in $\mathbb{F}_p^n$ and its Application to Non-malleable Codes. CoRR abs/1602.02788 (2016) - 2015
- [j1]Divesh Aggarwal:
Affine-evasive sets modulo a prime. Inf. Process. Lett. 115(2): 382-385 (2015) - [c11]Divesh Aggarwal, Daniel Dadush, Noah Stephens-Davidowitz:
Solving the Closest Vector Problem in 2^n Time - The Discrete Gaussian Strikes Again! FOCS 2015: 563-582 - [c10]Divesh Aggarwal, Alexander Golovnev:
A note on lower bounds for non-interactive message authentication using weak keys. ITW Fall 2015: 249-251 - [c9]Divesh Aggarwal, Yevgeniy Dodis, Tomasz Kazana, Maciej Obremski:
Non-malleable Reductions and Applications. STOC 2015: 459-468 - [c8]Divesh Aggarwal, Daniel Dadush, Oded Regev, Noah Stephens-Davidowitz:
Solving the Shortest Vector Problem in 2n Time Using Discrete Gaussian Sampling: Extended Abstract. STOC 2015: 733-742 - [c7]Divesh Aggarwal, Stefan Dziembowski, Tomasz Kazana, Maciej Obremski:
Leakage-Resilient Non-malleable Codes. TCC (1) 2015: 398-426 - [i19]Divesh Aggarwal, Daniel Dadush, Noah Stephens-Davidowitz:
Solving the Closest Vector Problem in $2^n$ Time - The Discrete Gaussian Strikes Again! CoRR abs/1504.01995 (2015) - [i18]Divesh Aggarwal, Kaave Hosseini, Shachar Lovett:
Affine-malleable Extractors, Spectrum Doubling, and Application to Privacy Amplification. Electron. Colloquium Comput. Complex. TR15 (2015) - [i17]Divesh Aggarwal, Alexander Golovnev:
A Note on Lower Bounds for Non-interactive Message Authentication Using Weak Keys. IACR Cryptol. ePrint Arch. 2015: 324 (2015) - [i16]Divesh Aggarwal, Tomasz Kazana, Maciej Obremski:
Inception Makes Non-malleable Codes Stronger. IACR Cryptol. ePrint Arch. 2015: 1013 (2015) - [i15]Divesh Aggarwal, Shashank Agrawal, Divya Gupta, Hemanta K. Maji, Omkant Pandey, Manoj Prabhakaran:
Optimal Computational Split-state Non-malleable Codes. IACR Cryptol. ePrint Arch. 2015: 1063 (2015) - [i14]Divesh Aggarwal, Kaave Hosseini, Shachar Lovett:
Affine-malleable Extractors, Spectrum Doubling, and Application to Privacy Amplification. IACR Cryptol. ePrint Arch. 2015: 1094 (2015) - 2014
- [c6]Divesh Aggarwal, Yevgeniy Dodis, Zahra Jafargholi, Eric Miles, Leonid Reyzin:
Amplifying Privacy in Privacy Amplification. CRYPTO (2) 2014: 183-198 - [c5]Divesh Aggarwal, Yevgeniy Dodis, Shachar Lovett:
Non-malleable codes from additive combinatorics. STOC 2014: 774-783 - [i13]Divesh Aggarwal, Daniel Dadush, Oded Regev, Noah Stephens-Davidowitz:
Solving the Shortest Vector Problem in $2^n$ Time via Discrete Gaussian Sampling. CoRR abs/1412.7994 (2014) - [i12]Divesh Aggarwal, Yevgeniy Dodis, Tomasz Kazana, Maciej Obremski:
Non-malleable Reductions and Applications. Electron. Colloquium Comput. Complex. TR14 (2014) - [i11]Divesh Aggarwal, Stefan Dziembowski, Tomasz Kazana, Maciej Obremski:
Leakage-resilient non-malleable codes. Electron. Colloquium Comput. Complex. TR14 (2014) - [i10]Divesh Aggarwal:
Affine-evasive Sets Modulo a Prime. IACR Cryptol. ePrint Arch. 2014: 328 (2014) - [i9]Divesh Aggarwal, Stefan Dziembowski, Tomasz Kazana, Maciej Obremski:
Leakage-resilient non-malleable codes. IACR Cryptol. ePrint Arch. 2014: 807 (2014) - [i8]Divesh Aggarwal, Yevgeniy Dodis, Tomasz Kazana, Maciej Obremski:
Non-malleable Reductions and Applications. IACR Cryptol. ePrint Arch. 2014: 821 (2014) - 2013
- [i7]Divesh Aggarwal, Oded Regev:
A Note on Discrete Gaussian Combinations of Lattice Vectors. CoRR abs/1308.2405 (2013) - [i6]Divesh Aggarwal, Chandan K. Dubey:
Improved hardness results for unique shortest vector problem. Electron. Colloquium Comput. Complex. TR13 (2013) - [i5]Divesh Aggarwal, Yevgeniy Dodis, Shachar Lovett:
Non-malleable Codes from Additive Combinatorics. Electron. Colloquium Comput. Complex. TR13 (2013) - [i4]Divesh Aggarwal, Yevgeniy Dodis, Shachar Lovett:
Non-malleable Codes from Additive Combinatorics. IACR Cryptol. ePrint Arch. 2013: 201 (2013) - [i3]Divesh Aggarwal, Yevgeniy Dodis, Zahra Jafargholi, Eric Miles, Leonid Reyzin:
Amplifying Privacy in Privacy Amplification. IACR Cryptol. ePrint Arch. 2013: 723 (2013) - 2011
- [c4]Divesh Aggarwal, Ueli Maurer:
The Leakage-Resilience Limit of a Computational Problem Is Equal to Its Unpredictability Entropy. ASIACRYPT 2011: 686-701 - [i2]Divesh Aggarwal, Chandan K. Dubey:
Improved hardness results for unique shortest vector problem. CoRR abs/1112.1564 (2011)
2000 – 2009
- 2009
- [c3]Divesh Aggarwal, Ueli M. Maurer:
Breaking RSA Generically Is Equivalent to Factoring. EUROCRYPT 2009: 36-53 - 2008
- [i1]Divesh Aggarwal, Ueli Maurer:
Breaking RSA Generically is Equivalent to Factoring. IACR Cryptol. ePrint Arch. 2008: 260 (2008) - 2006
- [c2]Divesh Aggarwal, Chandan K. Dubey, Shashank K. Mehta:
Algorithms on Graphs with Small Dominating Targets. ISAAC 2006: 141-152 - 2005
- [c1]Divesh Aggarwal, Shashank K. Mehta, Jitender S. Deogun:
Domination Search on Graphs with Low Dominating-Target-Number. WG 2005: 28-37
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-08-22 20:53 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:
