default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMahak Pancholi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i9]James Hsin-Yu Chiang, Ivan Damgård, Claudio Orlandi, Mahak Pancholi, Mark Simkin:
Securely Computing One-Sided Matching Markets. IACR Cryptol. ePrint Arch. 2024: 1657 (2024)- 2023
- [c6]Lennart Braun
, Mahak Pancholi, Rahul Rachuri, Mark Simkin:
Ramen: Souper Fast Three-Party Computation for RAM Programs. CCS 2023: 3284-3297 - [c5]Chaya Ganesh, Yashvanth Kondi, Claudio Orlandi, Mahak Pancholi, Akira Takahashi, Daniel Tschudi:
Witness-Succinct Universally-Composable SNARKs. EUROCRYPT (2) 2023: 315-346 - [c4]Markulf Kohlweiss, Mahak Pancholi, Akira Takahashi:
How to Compile Polynomial IOP into Simulation-Extractable SNARKs: A Modular Approach. TCC (3) 2023: 486-512 - [i8]Chaya Ganesh, Claudio Orlandi, Mahak Pancholi, Akira Takahashi, Daniel Tschudi:
Fiat-Shamir Bulletproofs are Non-Malleable (in the Random Oracle Model). IACR Cryptol. ePrint Arch. 2023: 147 (2023) - [i7]Lennart Braun, Mahak Pancholi, Rahul Rachuri, Mark Simkin:
Ramen: Souper Fast Three-Party Computation for RAM Programs. IACR Cryptol. ePrint Arch. 2023: 310 (2023) - [i6]Markulf Kohlweiss, Mahak Pancholi, Akira Takahashi:
How to Compile Polynomial IOP into Simulation-Extractable SNARKs: A Modular Approach. IACR Cryptol. ePrint Arch. 2023: 1067 (2023) - 2022
- [c3]Chaya Ganesh, Claudio Orlandi, Mahak Pancholi, Akira Takahashi, Daniel Tschudi:
Fiat-Shamir Bulletproofs are Non-Malleable (in the Algebraic Group Model). EUROCRYPT (2) 2022: 397-426 - [i5]Chaya Ganesh, Yashvanth Kondi, Claudio Orlandi, Mahak Pancholi, Akira Takahashi, Daniel Tschudi:
Witness-Succinct Universally-Composable SNARKs. IACR Cryptol. ePrint Arch. 2022: 1618 (2022) - 2021
- [c2]Suvradip Chakraborty, Chaya Ganesh, Mahak Pancholi, Pratik Sarkar:
Reverse Firewalls for Adaptively Secure MPC Without Setup. ASIACRYPT (2) 2021: 335-364 - [c1]Nishat Koti, Mahak Pancholi, Arpita Patra, Ajith Suresh:
SWIFT: Super-fast and Robust Privacy-Preserving Machine Learning. USENIX Security Symposium 2021: 2651-2668 - [i4]Suvradip Chakraborty, Chaya Ganesh, Mahak Pancholi, Pratik Sarkar:
Reverse Firewalls for Adaptively Secure MPC without Setup. IACR Cryptol. ePrint Arch. 2021: 1262 (2021) - [i3]Chaya Ganesh, Claudio Orlandi, Mahak Pancholi, Akira Takahashi, Daniel Tschudi:
Fiatâ€"Shamir Bulletproofs are Non-Malleable (in the Algebraic Group Model). IACR Cryptol. ePrint Arch. 2021: 1393 (2021) - 2020
- [i2]Nishat Koti, Mahak Pancholi, Arpita Patra, Ajith Suresh:
SWIFT: Super-fast and Robust Privacy-Preserving Machine Learning. CoRR abs/2005.10296 (2020) - [i1]Nishat Koti, Mahak Pancholi, Arpita Patra, Ajith Suresh:
SWIFT: Super-fast and Robust Privacy-Preserving Machine Learning. IACR Cryptol. ePrint Arch. 2020: 592 (2020)
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-11-08 21:32 CET 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:
