default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDakshita Khurana
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
[c53]James Bartusek, Vipul Goyal, Dakshita Khurana, Giulio Malavolta, Justin Raizes, Bhaskar Roberts:
Software with Certified Deletion. EUROCRYPT (4) 2024: 85-111- [c52]Dakshita Khurana
, Kabir Tomer:
Commitments from Quantum One-Wayness. STOC 2024: 968-978 - [i65]Dakshita Khurana, Kabir Tomer:
Founding Quantum Cryptography on Quantum Advantage, or, Towards Cryptography from #P-Hardness. CoRR abs/2409.15248 (2024) - [i64]Dakshita Khurana, Kabir Tomer:
Founding Quantum Cryptography on Quantum Advantage, or, Towards Cryptography from #P-Hardness. IACR Cryptol. ePrint Arch. 2024: 1490 (2024) - 2023
- [c51]Dakshita Khurana, Giulio Malavolta, Kabir Tomer:
Weak Zero-Knowledge via the Goldreich-Levin Theorem. ASIACRYPT (2) 2023: 142-173 - [c50]James Bartusek, Dakshita Khurana, Alexander Poremba:
Publicly-Verifiable Deletion via Target-Collapsing Functions. CRYPTO (5) 2023: 99-128 - [c49]James Bartusek, Dakshita Khurana:
Cryptography with Certified Deletion. CRYPTO (5) 2023: 192-223 - [c48]James Bartusek, Dakshita Khurana, Akshayaram Srinivasan:
Secure Computation with Shared EPR Pairs (Or: How to Teleport in Zero-Knowledge). CRYPTO (5) 2023: 224-257 - [c47]Yuval Ishai, Dakshita Khurana, Amit Sahai, Akshayaram Srinivasan:
Round-Optimal Black-Box MPC in the Plain Model. CRYPTO (1) 2023: 393-426 - [c46]Yuval Ishai, Dakshita Khurana, Amit Sahai, Akshayaram Srinivasan:
Black-Box Reusable NISC with Random Oracles. EUROCRYPT (2) 2023: 68-97 - [c45]Rachit Garg, Dakshita Khurana, George Lu, Brent Waters:
On Non-uniform Security for Black-Box Non-interactive CCA Commitments. EUROCRYPT (1) 2023: 173-204 - [c44]Amit Agarwal, James Bartusek, Dakshita Khurana, Nishant Kumar:
A New Framework for Quantum Oblivious Transfer. EUROCRYPT (1) 2023: 363-394 - [c43]Amit Agarwal, Navid Alamati, Dakshita Khurana, Srinivasan Raghuraman, Peter Rindal:
On Black-Box Verifiable Outsourcing. TCC (1) 2023: 158-187 - [c42]James Bartusek, Dakshita Khurana, Giulio Malavolta, Alexander Poremba, Michael Walter:
Weakening Assumptions for Publicly-Verifiable Deletion. TCC (4) 2023: 183-197 - [i63]James Bartusek, Dakshita Khurana, Alexander Poremba:
Publicly-Verifiable Deletion via Target-Collapsing Functions. CoRR abs/2303.08676 (2023) - [i62]James Bartusek, Dakshita Khurana, Giulio Malavolta, Alexander Poremba, Michael Walter:
Weakening Assumptions for Publicly-Verifiable Deletion. CoRR abs/2304.09846 (2023) - [i61]James Bartusek, Dakshita Khurana, Akshayaram Srinivasan:
Secure Computation with Shared EPR Pairs (Or: How to Teleport in Zero-Knowledge). CoRR abs/2304.10480 (2023) - [i60]Ruta Jawale, Dakshita Khurana:
Unclonable Non-Interactive Zero-Knowledge. CoRR abs/2310.07118 (2023) - [i59]Dakshita Khurana, Kabir Tomer:
Commitments from Quantum One-Wayness. CoRR abs/2310.11526 (2023) - [i58]James Bartusek, Sanjam Garg, Vipul Goyal, Dakshita Khurana, Giulio Malavolta, Justin Raizes, Bhaskar Roberts:
Obfuscation and Outsourced Computation with Certified Deletion. IACR Cryptol. ePrint Arch. 2023: 265 (2023) - [i57]James Bartusek, Dakshita Khurana, Alexander Poremba:
Publicly-Verifiable Deletion via Target-Collapsing Functions. IACR Cryptol. ePrint Arch. 2023: 370 (2023) - [i56]Yuval Ishai, Dakshita Khurana, Amit Sahai, Akshayaram Srinivasan:
Black-Box Reusable NISC with Random Oracles. IACR Cryptol. ePrint Arch. 2023: 514 (2023) - [i55]James Bartusek, Dakshita Khurana, Giulio Malavolta, Alexander Poremba, Michael Walter:
Weakening Assumptions for Publicly-Verifiable Deletion. IACR Cryptol. ePrint Arch. 2023: 559 (2023) - [i54]James Bartusek, Dakshita Khurana, Akshayaram Srinivasan:
Secure Computation with Shared EPR Pairs (Or: How to Teleport in Zero-Knowledge). IACR Cryptol. ePrint Arch. 2023: 564 (2023) - [i53]Yuval Ishai, Dakshita Khurana, Amit Sahai, Akshayaram Srinivasan:
Round-Optimal Black-Box MPC in the Plain Model. IACR Cryptol. ePrint Arch. 2023: 1173 (2023) - [i52]Amit Agarwal, Navid Alamati, Dakshita Khurana, Srinivasan Raghuraman, Peter Rindal:
On Black-Box Verifiable Outsourcing. IACR Cryptol. ePrint Arch. 2023: 1466 (2023) - [i51]Ruta Jawale, Dakshita Khurana:
Unclonable Non-Interactive Zero-Knowledge. IACR Cryptol. ePrint Arch. 2023: 1532 (2023) - [i50]Dakshita Khurana, Kabir Tomer:
Commitments from Quantum One-Wayness. IACR Cryptol. ePrint Arch. 2023: 1620 (2023) - 2022
- [c41]Saikrishna Badrinarayanan, Yuval Ishai, Dakshita Khurana, Amit Sahai, Daniel Wichs:
Refuting the Dream XOR Lemma via Ideal Obfuscation and Resettable MPC. ITC 2022: 10:1-10:21 - [c40]Yuval Ishai, Dakshita Khurana, Amit Sahai, Akshayaram Srinivasan:
Round-Optimal Black-Box Protocol Compilers. EUROCRYPT (1) 2022: 210-240 - [c39]James Hulett, Ruta Jawale, Dakshita Khurana, Akshayaram Srinivasan:
SNARGs for P from Sub-exponential DDH and QR. EUROCRYPT (2) 2022: 520-549 - [c38]Ran Canetti, Suvradip Chakraborty, Dakshita Khurana, Nishant Kumar, Oxana Poburinnaya, Manoj Prabhakaran:
COA-Secure Obfuscation and Applications. EUROCRYPT (1) 2022: 731-758 - [c37]Yuval Ishai, Dakshita Khurana, Amit Sahai, Akshayaram Srinivasan:
Round-Optimal Black-Box Secure Computation from Two-Round Malicious OT. TCC (2) 2022: 441-469 - [i49]James Bartusek, Dakshita Khurana:
Cryptography with Certified Deletion. CoRR abs/2207.01754 (2022) - [i48]Amit Agarwal, James Bartusek, Dakshita Khurana, Nishant Kumar:
A New Framework for Quantum Oblivious Transfer. CoRR abs/2209.04520 (2022) - [i47]James Hulett, Ruta Jawale, Dakshita Khurana, Akshayaram Srinivasan:
SNARGs for P from Sub-exponential DDH and QR. IACR Cryptol. ePrint Arch. 2022: 353 (2022) - [i46]Saikrishna Badrinarayanan, Yuval Ishai, Dakshita Khurana, Amit Sahai, Daniel Wichs:
Refuting the Dream XOR Lemma via Ideal Obfuscation and Resettable MPC. IACR Cryptol. ePrint Arch. 2022: 681 (2022) - [i45]Yuval Ishai, Dakshita Khurana, Amit Sahai, Akshayaram Srinivasan:
Round-Optimal Black-Box Protocol Compilers. IACR Cryptol. ePrint Arch. 2022: 887 (2022) - [i44]Rachit Garg, Dakshita Khurana, George Lu, Brent Waters:
On Non-uniform Security for Black-box Non-Interactive CCA Commitments. IACR Cryptol. ePrint Arch. 2022: 1032 (2022) - [i43]James Bartusek, Dakshita Khurana:
Cryptography with Certified Deletion. IACR Cryptol. ePrint Arch. 2022: 1178 (2022) - [i42]Amit Agarwal, James Bartusek, Dakshita Khurana, Nishant Kumar:
A New Framework for Quantum Oblivious Transfer. IACR Cryptol. ePrint Arch. 2022: 1191 (2022) - [i41]Yuval Ishai, Dakshita Khurana, Amit Sahai, Akshayaram Srinivasan:
Round-Optimal Black-Box Secure Computation from Two-Round Malicious OT. IACR Cryptol. ePrint Arch. 2022: 1288 (2022) - [i40]Ran Canetti, Suvradip Chakraborty, Dakshita Khurana, Nishant Kumar, Oxana Poburinnaya, Manoj Prabhakaran:
COA-Secure Obfuscation and Applications. IACR Cryptol. ePrint Arch. 2022: 1781 (2022) - 2021
- [c36]Yuval Ishai, Dakshita Khurana, Amit Sahai, Akshayaram Srinivasan:
On the Round Complexity of Black-Box Secure MPC. CRYPTO (2) 2021: 214-243 - [c35]Rohit Chatterjee, Sanjam Garg, Mohammad Hajiabadi, Dakshita Khurana, Xiao Liang, Giulio Malavolta, Omkant Pandey, Sina Shiehian:
Compact Ring Signatures from Learning with Errors. CRYPTO (1) 2021: 282-312 - [c34]James Bartusek, Andrea Coladangelo, Dakshita Khurana, Fermi Ma:
On the Round Complexity of Secure Quantum Computation. CRYPTO (1) 2021: 406-435 - [c33]James Bartusek, Andrea Coladangelo, Dakshita Khurana, Fermi Ma:
One-Way Functions Imply Secure Computation in a Quantum World. CRYPTO (1) 2021: 467-496 - [c32]Dakshita Khurana, Akshayaram Srinivasan:
Improved Computational Extractors and Their Applications. CRYPTO (3) 2021: 566-594 - [c31]Rachit Garg, Dakshita Khurana, George Lu, Brent Waters:
Black-Box Non-interactive Non-malleable Commitments. EUROCRYPT (3) 2021: 159-185 - [c30]Dakshita Khurana:
Non-interactive Distributional Indistinguishability (NIDI) and Non-malleable Commitments. EUROCRYPT (3) 2021: 186-215 - [c29]Amit Agarwal, James Bartusek, Vipul Goyal, Dakshita Khurana, Giulio Malavolta:
Post-Quantum Multi-Party Computation. EUROCRYPT (1) 2021: 435-464 - [c28]Dakshita Khurana, Brent Waters:
On the CCA Compatibility of Public-Key Infrastructure. Public Key Cryptography (2) 2021: 235-260 - [c27]Ruta Jawale, Yael Tauman Kalai, Dakshita Khurana, Rachel Yun Zhang:
SNARGs for bounded depth computations and PPAD hardness from sub-exponential LWE. STOC 2021: 708-721 - [c26]Amit Agarwal, James Bartusek, Vipul Goyal, Dakshita Khurana, Giulio Malavolta:
Two-Round Maliciously Secure Computation with Super-Polynomial Simulation. TCC (1) 2021: 654-685 - [i39]Dakshita Khurana, Brent Waters:
On the CCA Compatibility of Public-Key Infrastructure. IACR Cryptol. ePrint Arch. 2021: 271 (2021) - [i38]Rohit Chatterjee, Sanjam Garg, Mohammad Hajiabadi, Dakshita Khurana, Xiao Liang, Giulio Malavolta, Omkant Pandey, Sina Shiehian:
Compact Ring Signatures from Learning With Errors. IACR Cryptol. ePrint Arch. 2021: 942 (2021) - [i37]Amit Agarwal, James Bartusek, Vipul Goyal, Dakshita Khurana, Giulio Malavolta:
Two-Round Maliciously Secure Computation with Super-Polynomial Simulation. IACR Cryptol. ePrint Arch. 2021: 1230 (2021) - [i36]Dakshita Khurana, Akshayaram Srinivasan:
Improved Computational Extractors and their Applications. IACR Cryptol. ePrint Arch. 2021: 1336 (2021) - [i35]Dakshita Khurana:
Non-interactive Distributional Indistinguishability (NIDI) and Non-Malleable Commitments. IACR Cryptol. ePrint Arch. 2021: 1404 (2021) - [i34]Yuval Ishai, Dakshita Khurana, Amit Sahai, Akshayaram Srinivasan:
On the Round Complexity of Black-box Secure MPC. IACR Cryptol. ePrint Arch. 2021: 1467 (2021) - 2020
- [c25]Ankit Garg, Yael Tauman Kalai, Dakshita Khurana:
Low Error Efficient Computational Extractors in the CRS Model. EUROCRYPT (1) 2020: 373-402 - [c24]Saikrishna Badrinarayanan, Rex Fernando, Aayush Jain, Dakshita Khurana, Amit Sahai:
Statistical ZAP Arguments. EUROCRYPT (3) 2020: 642-667 - [c23]Dakshita Khurana, Muhammad Haris Mughees:
On Statistical Security in Two-Party Computation. TCC (2) 2020: 532-561 - [i33]Amit Agarwal, James Bartusek, Vipul Goyal, Dakshita Khurana, Giulio Malavolta:
Post-Quantum Multi-Party Computation in Constant Rounds. CoRR abs/2005.12904 (2020) - [i32]James Bartusek, Andrea Coladangelo, Dakshita Khurana, Fermi Ma:
On The Round Complexity of Two-Party Quantum Computation. CoRR abs/2011.11212 (2020) - [i31]James Bartusek, Andrea Coladangelo, Dakshita Khurana, Fermi Ma:
One-Way Functions Imply Secure Computation in a Quantum World. CoRR abs/2011.13486 (2020) - [i30]Ruta Jawale, Dakshita Khurana:
Lossy Correlation Intractability and PPAD Hardness from Sub-exponential LWE. IACR Cryptol. ePrint Arch. 2020: 911 (2020) - [i29]Ruta Jawale, Yael Tauman Kalai, Dakshita Khurana, Rachel Yun Zhang:
SNARGs for Bounded Depth Computations and PPAD Hardness from Sub-Exponential LWE. IACR Cryptol. ePrint Arch. 2020: 980 (2020) - [i28]Rachit Garg, Dakshita Khurana, George Lu, Brent Waters:
Black-Box Non-Interactive Non-Malleable Commitments. IACR Cryptol. ePrint Arch. 2020: 1197 (2020) - [i27]Amit Agarwal, James Bartusek, Vipul Goyal, Dakshita Khurana, Giulio Malavolta:
Post-Quantum Multi-Party Computation. IACR Cryptol. ePrint Arch. 2020: 1395 (2020) - [i26]Dakshita Khurana, Muhammad Haris Mughees:
On Statistical Security in Two-Party Computation. IACR Cryptol. ePrint Arch. 2020: 1428 (2020) - [i25]James Bartusek, Andrea Coladangelo, Dakshita Khurana, Fermi Ma:
On The Round Complexity of Two-Party Quantum Computation. IACR Cryptol. ePrint Arch. 2020: 1471 (2020) - [i24]James Bartusek, Andrea Coladangelo, Dakshita Khurana, Fermi Ma:
One-Way Functions Imply Secure Computation in a Quantum World. IACR Cryptol. ePrint Arch. 2020: 1487 (2020)
2010 – 2019
- 2019
- [c22]Yael Tauman Kalai, Dakshita Khurana:
Non-interactive Non-malleability from Quantum Supremacy. CRYPTO (3) 2019: 552-582 - [c21]Nir Bitansky, Dakshita Khurana, Omer Paneth:
Weak zero-knowledge beyond the black-box barrier. STOC 2019: 1091-1102 - [i23]Saikrishna Badrinarayanan, Rex Fernando, Aayush Jain, Dakshita Khurana, Amit Sahai:
Statistical ZAP Arguments. IACR Cryptol. ePrint Arch. 2019: 780 (2019) - [i22]Ankit Garg, Yael Tauman Kalai, Dakshita Khurana:
Computational Extractors with Negligible Error in the CRS Model. IACR Cryptol. ePrint Arch. 2019: 1116 (2019) - 2018
- [b1]Dakshita Khurana:
How to Rewind with Minimal Interaction. University of California, Los Angeles, USA, 2018 - [c20]Saikrishna Badrinarayanan, Vipul Goyal, Abhishek Jain, Yael Tauman Kalai, Dakshita Khurana, Amit Sahai:
Promise Zero Knowledge and Its Applications to Round Optimal MPC. CRYPTO (2) 2018: 459-487 - [c19]Yael Tauman Kalai, Dakshita Khurana, Amit Sahai:
Statistical Witness Indistinguishability (and more) in Two Messages. EUROCRYPT (3) 2018: 34-65 - [c18]Saikrishna Badrinarayanan, Yael Tauman Kalai, Dakshita Khurana, Amit Sahai, Daniel Wichs:
Succinct delegation for low-space non-deterministic computation. STOC 2018: 709-721 - [c17]Dakshita Khurana, Rafail Ostrovsky, Akshayaram Srinivasan:
Round Optimal Black-Box "Commit-and-Prove". TCC (1) 2018: 286-313 - [c16]Saikrishna Badrinarayanan, Dakshita Khurana, Amit Sahai, Brent Waters:
Upgrading to Functional Encryption. TCC (1) 2018: 629-658 - [i21]Saikrishna Badrinarayanan, Yael Kalai, Dakshita Khurana, Amit Sahai, Daniel Wichs:
Non-Interactive Delegation for Low-Space Non-Deterministic Computation. Electron. Colloquium Comput. Complex. TR18 (2018) - [i20]Yael Kalai, Dakshita Khurana:
Non-Interactive Non-Malleability from Quantum Supremacy. Electron. Colloquium Comput. Complex. TR18 (2018) - [i19]Yael Tauman Kalai, Dakshita Khurana, Amit Sahai:
Statistical Witness Indistinguishability (and more) in Two Messages. IACR Cryptol. ePrint Arch. 2018: 168 (2018) - [i18]Saikrishna Badrinarayanan, Dakshita Khurana, Amit Sahai, Brent Waters:
Upgrading to Functional Encryption. IACR Cryptol. ePrint Arch. 2018: 281 (2018) - [i17]Prabhanjan Ananth, Aayush Jain, Dakshita Khurana, Amit Sahai:
Indistinguishability Obfuscation Without Multilinear Maps: iO from LWE, Bilinear Maps, and Weak Pseudorandomness. IACR Cryptol. ePrint Arch. 2018: 615 (2018) - [i16]Dakshita Khurana, Rafail Ostrovsky, Akshayaram Srinivasan:
Round Optimal Black-Box “Commit-and-Prove”. IACR Cryptol. ePrint Arch. 2018: 921 (2018) - [i15]Yael Tauman Kalai, Dakshita Khurana:
Non-Interactive Non-Malleability from Quantum Supremacy. IACR Cryptol. ePrint Arch. 2018: 1118 (2018) - 2017
- [c15]Abhishek Jain, Yael Tauman Kalai, Dakshita Khurana, Ron Rothblum:
Distinguisher-Dependent Simulation in Two Rounds and its Applications. CRYPTO (2) 2017: 158-189 - [c14]Saikrishna Badrinarayanan, Dakshita Khurana, Rafail Ostrovsky, Ivan Visconti:
Unconditional UC-Secure Computation with (Stronger-Malicious) PUFs. EUROCRYPT (1) 2017: 382-411 - [c13]Dakshita Khurana, Amit Sahai:
How to Achieve Non-Malleability in One or Two Rounds. FOCS 2017: 564-575 - [c12]Dakshita Khurana:
Round Optimal Concurrent Non-malleability from Polynomial Hardness. TCC (2) 2017: 139-171 - [c11]Saikrishna Badrinarayanan, Vipul Goyal, Abhishek Jain, Dakshita Khurana, Amit Sahai:
Round Optimal Concurrent MPC via Strong Simulation. TCC (1) 2017: 743-775 - [i14]Dakshita Khurana, Amit Sahai:
How to Achieve Non-Malleability in One or Two Rounds. Electron. Colloquium Comput. Complex. TR17 (2017) - [i13]Dakshita Khurana, Amit Sahai:
Two-Message Non-Malleable Commitments from Standard Sub-exponential Assumptions. IACR Cryptol. ePrint Arch. 2017: 291 (2017) - [i12]Abhishek Jain, Yael Tauman Kalai, Dakshita Khurana, Ron Rothblum:
Distinguisher-Dependent Simulation in Two Rounds and its Applications. IACR Cryptol. ePrint Arch. 2017: 330 (2017) - [i11]Saikrishna Badrinarayanan, Vipul Goyal, Abhishek Jain, Dakshita Khurana, Amit Sahai:
Round Optimal Concurrent MPC via Strong Simulation. IACR Cryptol. ePrint Arch. 2017: 597 (2017) - [i10]Dakshita Khurana:
Round Optimal Concurrent Non-Malleability from Polynomial Hardness. IACR Cryptol. ePrint Arch. 2017: 734 (2017) - [i9]Saikrishna Badrinarayanan, Vipul Goyal, Abhishek Jain, Yael Tauman Kalai, Dakshita Khurana, Amit Sahai:
Promise Zero Knowledge and its Applications to Round Optimal MPC. IACR Cryptol. ePrint Arch. 2017: 1088 (2017) - [i8]Saikrishna Badrinarayanan, Yael Tauman Kalai, Dakshita Khurana, Amit Sahai, Daniel Wichs:
Non-Interactive Delegation for Low-Space Non-Deterministic Computation. IACR Cryptol. ePrint Arch. 2017: 1250 (2017) - 2016
- [c10]Dennis Hofheinz, Tibor Jager, Dakshita Khurana, Amit Sahai, Brent Waters, Mark Zhandry:
How to Generate and Use Universal Samplers. ASIACRYPT (2) 2016: 715-744 - [c9]Dakshita Khurana, Hemanta K. Maji, Amit Sahai:
Secure Computation from Elastic Noisy Channels. EUROCRYPT (2) 2016: 184-212 - [c8]Dakshita Khurana, Daniel Kraschewski, Hemanta K. Maji, Manoj Prabhakaran, Amit Sahai:
All Complete Functionalities are Reversible. EUROCRYPT (2) 2016: 213-242 - [c7]Vipul Goyal, Dakshita Khurana, Amit Sahai:
Breaking the Three Round Barrier for Non-malleable Commitments. FOCS 2016: 21-30 - [c6]Vipul Goyal, Dakshita Khurana, Ilya Mironov, Omkant Pandey, Amit Sahai:
Do Distributed Differentially-Private Protocols Require Oblivious Transfer?. ICALP 2016: 29:1-29:15 - [i7]Daniel Kraschewski, Dakshita Khurana, Hemanta K. Maji, Manoj Prabhakaran, Amit Sahai:
All Complete Functionalities are Reversible. IACR Cryptol. ePrint Arch. 2016: 496 (2016) - [i6]Dakshita Khurana, Hemanta K. Maji, Amit Sahai:
Secure Computation from Elastic Noisy Channels. IACR Cryptol. ePrint Arch. 2016: 497 (2016) - [i5]Saikrishna Badrinarayanan, Dakshita Khurana, Rafail Ostrovsky, Ivan Visconti:
New Feasibility Results in Unconditional UC-Secure Computation with (Malicious) PUFs. IACR Cryptol. ePrint Arch. 2016: 636 (2016) - 2015
- [c5]Dakshita Khurana, Vanishree Rao, Amit Sahai:
Multi-party Key Exchange for Unbounded Parties from Indistinguishability Obfuscation. ASIACRYPT (1) 2015: 52-75 - [c4]Shweta Agrawal, Yuval Ishai, Dakshita Khurana, Anat Paskin-Cherniavsky:
Statistical Randomized Encodings: A Complexity Theoretic View. ICALP (1) 2015: 1-13 - [i4]Vipul Goyal, Dakshita Khurana, Ilya Mironov, Omkant Pandey, Amit Sahai:
Do Distributed Differentially-Private Protocols Require Oblivious Transfer? IACR Cryptol. ePrint Arch. 2015: 1090 (2015) - [i3]Vipul Goyal, Aayush Jain, Dakshita Khurana:
Witness Signatures and Non-Malleable Multi-Prover Zero-Knowledge Proofs. IACR Cryptol. ePrint Arch. 2015: 1095 (2015) - 2014
- [c3]Dakshita Khurana, Hemanta K. Maji, Amit Sahai:
Black-Box Separations for Differentially Private Protocols. ASIACRYPT (2) 2014: 386-405 - [i2]Dakshita Khurana, Amit Sahai, Brent Waters:
How to Generate and use Universal Parameters. IACR Cryptol. ePrint Arch. 2014: 507 (2014) - [i1]Dakshita Khurana, Hemanta K. Maji, Amit Sahai:
Black Box Separations for Differentially Private Protocols. IACR Cryptol. ePrint Arch. 2014: 957 (2014) - 2012
- [c2]Dakshita Khurana, Surabhi Sankhla, Abhinav Shukla, Richa Varshney, Prem Kalra, Subhashis Banerjee:
A grammar-based GUI for single view reconstruction. ICVGIP 2012: 14 - 2011
- [c1]Dakshita Khurana, Aditya Gaurav:
Ensuring tight computational security against higher-order DPA attacks. PST 2011: 96-101
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-10-22 20:16 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:
