default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPratyay Mukherjee
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c33]Sanjam Garg, Abhishek Jain, Pratyay Mukherjee, Mingyuan Wang:
Scalable Multiparty Computation from Non-linear Secret Sharing. CRYPTO (8) 2024: 384-417- [c32]Sanjam Garg, Abhishek Jain, Pratyay Mukherjee, Rohit Sinha, Mingyuan Wang, Yinuo Zhang:
hinTS: Threshold Signatures with Silent Setup. SP 2024: 3034-3052 - [i38]Pousali Dey, Pratyay Mukherjee, Swagata Sasmal, Rohit Sinha:
HiSE: Hierarchical (Threshold) Symmetric-key Encryption. IACR Cryptol. ePrint Arch. 2024: 158 (2024) - [i37]Jacob Gorman, Lucjan Hanzlik, Aniket Kate, Easwar Vivek Mangipudi, Pratyay Mukherjee, Pratik Sarkar, Sri Aravinda Krishnan Thyagarajan:
VRaaS: Verifiable Randomness as a Service on Blockchains. IACR Cryptol. ePrint Arch. 2024: 957 (2024) - [i36]Sanjam Garg, Aniket Kate, Pratyay Mukherjee, Rohit Sinha, Sriram Sridhar:
Insta-Pok3r: Real-time Poker on Blockchain. IACR Cryptol. ePrint Arch. 2024: 1061 (2024) - [i35]Megan Chen, Pousali Dey, Chaya Ganesh, Pratyay Mukherjee, Pratik Sarkar, Swagata Sasmal:
Universally Composable Non-Interactive Zero-Knowledge from Sigma Protocols via a New Straight-line Compiler. IACR Cryptol. ePrint Arch. 2024: 1713 (2024) - 2023
- [c31]Aniket Kate
, Easwar Vivek Mangipudi, Siva Maradana, Pratyay Mukherjee:
FlexiRand: Output Private (Distributed) VRFs and Application to Blockchains. CCS 2023: 1776-1790 - [c30]Sanjam Garg, Abhishek Jain, Pratyay Mukherjee, Rohit Sinha, Mingyuan Wang, Yinuo Zhang:
Cryptography with Weights: MPC, Encryption and Signatures. CRYPTO (1) 2023: 295-327 - [c29]Pratyay Mukherjee, Ramanathan A, Sawvranu Dey:
Efficient Vehicle Routing Problem: A Machine Learning and Evolutionary Computation Approach. GECCO Companion 2023: 3-4 - [c28]Saikrishna Badrinarayanan, Daniel Masny, Pratyay Mukherjee, Sikhar Patranabis, Srinivasan Raghuraman, Pratik Sarkar:
Round-Optimal Oblivious Transfer and MPC from Computational CSIDH. Public Key Cryptography (1) 2023: 376-405 - [c27]Leemon Baird, Sanjam Garg, Abhishek Jain, Pratyay Mukherjee, Rohit Sinha, Mingyuan Wang, Yinuo Zhang:
Threshold Signatures in the Multiverse. SP 2023: 1454-1470 - [c26]Saikrishna Badrinarayanan, Peihan Miao, Pratyay Mukherjee, Divya Ravi:
On the Round Complexity of Fully Secure Solitary MPC with Honest Majority. TCC (2) 2023: 124-155 - [i34]Leemon Baird, Sanjam Garg, Abhishek Jain, Pratyay Mukherjee, Rohit Sinha, Mingyuan Wang, Yinuo Zhang:
Threshold Signatures in the Multiverse. IACR Cryptol. ePrint Arch. 2023: 63 (2023) - [i33]Aniket Kate, Easwar Vivek Mangipudi, Pratyay Mukherjee, Hamza Saleem, Sri Aravinda Krishnan Thyagarajan:
Non-interactive VSS using Class Groups and Application to DKG. IACR Cryptol. ePrint Arch. 2023: 451 (2023) - [i32]Sanjam Garg, Abhishek Jain, Pratyay Mukherjee, Rohit Sinha, Mingyuan Wang, Yinuo Zhang:
hinTS: Threshold Signatures with Silent Setup. IACR Cryptol. ePrint Arch. 2023: 567 (2023) - [i31]Aniket Kate, Easwar Vivek Mangipudi, Siva Maradana, Pratyay Mukherjee:
FlexiRand: Output Private (Distributed) VRFs and Application to Blockchains. IACR Cryptol. ePrint Arch. 2023: 1339 (2023) - 2022
- [c25]Saikrishna Badrinarayanan, Daniel Masny, Pratyay Mukherjee:
Efficient and Tight Oblivious Transfer from PKE with Tight Multi-user Security. ACNS 2022: 626-642 - [c24]Leemon Baird, Pratyay Mukherjee, Rohit Sinha:
i-TiRE: Incremental Timed-Release Encryption or How to use Timed-Release Encryption on Blockchains? CCS 2022: 235-248 - [c23]Alexander Bienstock, Jaiden Fairoze, Sanjam Garg, Pratyay Mukherjee, Srinivasan Raghuraman:
A More Complete Analysis of the Signal Double Ratchet Algorithm. CRYPTO (1) 2022: 784-813 - [c22]Shashank Agrawal, Wei Dai, Atul Luykx, Pratyay Mukherjee, Peter Rindal:
ParaDiSE: Efficient Threshold Authenticated Encryption in Fully Malicious Model. INDOCRYPT 2022: 26-51 - [i30]Alexander Bienstock, Jaiden Fairoze, Sanjam Garg, Pratyay Mukherjee, Srinivasan Raghuraman:
A More Complete Analysis of the Signal Double Ratchet Algorithm. IACR Cryptol. ePrint Arch. 2022: 355 (2022) - [i29]Saikrishna Badrinarayanan, Daniel Masny, Pratyay Mukherjee:
Efficient and Tight Oblivious Transfer from PKE with Tight Multi-User Security. IACR Cryptol. ePrint Arch. 2022: 415 (2022) - [i28]Shashank Agrawal, Wei Dai, Atul Luykx, Pratyay Mukherjee, Peter Rindal:
ParaDiSE: Efficient Threshold Authenticated Encryption in Fully Malicious Model. IACR Cryptol. ePrint Arch. 2022: 1449 (2022) - [i27]Saikrishna Badrinarayanan, Daniel Masny, Pratyay Mukherjee, Sikhar Patranabis, Srinivasan Raghuraman, Pratik Sarkar:
Round-Optimal Oblivious Transfer and MPC from Computational CSIDH. IACR Cryptol. ePrint Arch. 2022: 1511 (2022) - [i26]Siddhartha Chowdhury, Sayani Sinha, Animesh Singh, Shubham Mishra, Chandan Chaudhary, Sikhar Patranabis, Pratyay Mukherjee, Ayantika Chatterjee, Debdeep Mukhopadhyay:
Efficient Threshold FHE with Application to Real-Time Systems. IACR Cryptol. ePrint Arch. 2022: 1625 (2022) - [i25]Sanjam Garg, Abhishek Jain, Pratyay Mukherjee, Rohit Sinha, Mingyuan Wang, Yinuo Zhang:
Cryptography with Weights: MPC, Encryption and Signatures. IACR Cryptol. ePrint Arch. 2022: 1632 (2022) - 2021
- [c21]Mihai Christodorescu, Sivanarayana Gaddam, Pratyay Mukherjee, Rohit Sinha:
Amortized Threshold Symmetric-key Encryption. CCS 2021: 2758-2779 - [c20]Shashank Agrawal, Saikrishna Badrinarayanan, Payman Mohassel, Pratyay Mukherjee, Sikhar Patranabis:
BETA: Biometric-Enabled Threshold Authentication. Public Key Cryptography (2) 2021: 290-318 - [i24]Saikrishna Badrinarayanan, Peihan Miao, Pratyay Mukherjee, Divya Ravi:
On the Round Complexity of Fully Secure Solitary MPC with Honest Majority. IACR Cryptol. ePrint Arch. 2021: 241 (2021) - [i23]Leemon Baird, Pratyay Mukherjee, Rohit Sinha:
TEMP: Time-locked Encryption Made Practical. IACR Cryptol. ePrint Arch. 2021: 800 (2021) - [i22]Mihai Christodorescu, Sivanarayana Gaddam, Pratyay Mukherjee, Rohit Sinha:
Amortized Threshold Symmetric-key Encryption. IACR Cryptol. ePrint Arch. 2021: 1176 (2021) - 2020
- [j4]Sebastian Faust, Pratyay Mukherjee, Jesper Buus Nielsen, Daniele Venturi:
Continuously Non-malleable Codes in the Split-State Model. J. Cryptol. 33(4): 2034-2077 (2020) - [c19]Shashank Agrawal, Saikrishna Badrinarayanan, Pratyay Mukherjee, Peter Rindal:
Game-Set-MATCH: Using Mobile Devices for Seamless External-Facing Biometric Matching. CCS 2020: 1351-1370 - [c18]Pratyay Mukherjee:
Adaptively Secure Threshold Symmetric-Key Encryption. INDOCRYPT 2020: 465-487 - [c17]James Bartusek, Sanjam Garg, Daniel Masny, Pratyay Mukherjee:
Reusable Two-Round MPC from DDH. TCC (2) 2020: 320-348 - [i21]Saikrishna Badrinarayanan, James Bartusek, Sanjam Garg, Daniel Masny, Pratyay Mukherjee:
Reusable Two-Round MPC from DDH. IACR Cryptol. ePrint Arch. 2020: 170 (2020) - [i20]Shashank Agrawal, Saikrishna Badrinarayanan, Payman Mohassel, Pratyay Mukherjee, Sikhar Patranabis:
BETA: Biometric Enabled Threshold Authentication. IACR Cryptol. ePrint Arch. 2020: 679 (2020) - [i19]Pratyay Mukherjee:
Adaptively secure Threshold Symmetric-key Encryption. IACR Cryptol. ePrint Arch. 2020: 1329 (2020) - [i18]Shashank Agrawal, Saikrishna Badrinarayanan, Pratyay Mukherjee, Peter Rindal:
Game-Set-MATCH: Using Mobile Devices for Seamless External-Facing Biometric Matching. IACR Cryptol. ePrint Arch. 2020: 1363 (2020)
2010 – 2019
- 2019
- [c16]Yilei Chen, Nicholas Genise, Pratyay Mukherjee:
Approximate Trapdoors for Lattices and Smaller Hash-and-Sign Signatures. ASIACRYPT (3) 2019: 3-32 - [c15]Binyi Chen, Yilei Chen, Kristina Hostáková, Pratyay Mukherjee:
Continuous Space-Bounded Non-malleable Codes from Stronger Proofs-of-Space. CRYPTO (1) 2019: 467-495 - [i17]Binyi Chen, Yilei Chen, Kristina Hostáková, Pratyay Mukherjee:
Continuous Space-Bounded Non-Malleable Codes from Stronger Proofs-of-Space. IACR Cryptol. ePrint Arch. 2019: 552 (2019) - [i16]Yilei Chen, Nicholas Genise, Pratyay Mukherjee:
Approximate Trapdoors for Lattices and Smaller Hash-and-Sign Signatures. IACR Cryptol. ePrint Arch. 2019: 1029 (2019) - 2018
- [c14]Shashank Agrawal, Payman Mohassel, Pratyay Mukherjee, Peter Rindal:
DiSE: Distributed Symmetric-key Encryption. CCS 2018: 1993-2010 - [c13]Shashank Agrawal, Peihan Miao, Payman Mohassel, Pratyay Mukherjee:
PASTA: PASsword-based Threshold Authentication. CCS 2018: 2042-2059 - [c12]Nico Döttling, Sanjam Garg, Divya Gupta, Peihan Miao, Pratyay Mukherjee:
Obfuscation from Low Noise Multilinear Maps. INDOCRYPT 2018: 329-352 - [i15]Shashank Agrawal, Payman Mohassel, Pratyay Mukherjee, Peter Rindal:
DiSE: Distributed Symmetric-key Encryption. IACR Cryptol. ePrint Arch. 2018: 727 (2018) - [i14]Shashank Agrawal, Peihan Miao, Payman Mohassel, Pratyay Mukherjee:
PASTA: PASsword-based Threshold Authentication. IACR Cryptol. ePrint Arch. 2018: 885 (2018) - 2017
- [j3]Ivan Damgård, Sebastian Faust, Pratyay Mukherjee, Daniele Venturi:
Bounded Tamper Resilience: How to Go Beyond the Algebraic Barrier. J. Cryptol. 30(1): 152-190 (2017) - [c11]Sebastian Faust, Kristina Hostáková, Pratyay Mukherjee, Daniele Venturi:
Non-Malleable Codes for Space-Bounded Tampering. CRYPTO (2) 2017: 95-126 - [c10]Daniel Apon, Nico Döttling, Sanjam Garg, Pratyay Mukherjee:
Cryptanalysis of Indistinguishability Obfuscations of Circuits over GGH13. ICALP 2017: 38:1-38:16 - [i13]Sebastian Faust, Kristina Hostáková, Pratyay Mukherjee, Daniele Venturi:
Non-Malleable Codes for Space-Bounded Tampering. IACR Cryptol. ePrint Arch. 2017: 530 (2017) - 2016
- [j2]Sebastian Faust, Pratyay Mukherjee, Daniele Venturi, Daniel Wichs:
Efficient Non-Malleable Codes and Key Derivation for Poly-Size Tampering Circuits. IEEE Trans. Inf. Theory 62(12): 7179-7194 (2016) - [c9]Sanjam Garg, Pratyay Mukherjee, Omkant Pandey, Antigoni Polychroniadou:
The Exact Round Complexity of Secure Computation. EUROCRYPT (2) 2016: 448-476 - [c8]Pratyay Mukherjee, Daniel Wichs:
Two Round Multiparty Computation via Multi-key FHE. EUROCRYPT (2) 2016: 735-763 - [c7]Nishanth Chandran, Vipul Goyal, Pratyay Mukherjee, Omkant Pandey, Jalaj Upadhyay:
Block-Wise Non-Malleable Codes. ICALP 2016: 31:1-31:14 - [c6]Sanjam Garg, Eric Miles, Pratyay Mukherjee, Amit Sahai, Akshayaram Srinivasan, Mark Zhandry:
Secure Obfuscation in a Weak Multilinear Map Model. TCC (B2) 2016: 241-268 - [i12]Sanjam Garg, Pratyay Mukherjee, Omkant Pandey, Antigoni Polychroniadou:
The Exact Round Complexity of Secure Computation. IACR Cryptol. ePrint Arch. 2016: 252 (2016) - [i11]Sanjam Garg, Pratyay Mukherjee, Akshayaram Srinivasan:
Obfuscation without the Vulnerabilities of Multilinear Maps. IACR Cryptol. ePrint Arch. 2016: 390 (2016) - [i10]Nico Döttling, Sanjam Garg, Divya Gupta, Peihan Miao, Pratyay Mukherjee:
Obfuscation from Low Noise Multilinear Maps. IACR Cryptol. ePrint Arch. 2016: 599 (2016) - [i9]Sanjam Garg, Eric Miles, Pratyay Mukherjee, Amit Sahai, Akshayaram Srinivasan, Mark Zhandry:
Secure Obfuscation in a Weak Multilinear Map Model. IACR Cryptol. ePrint Arch. 2016: 817 (2016) - [i8]Daniel Apon, Nico Döttling, Sanjam Garg, Pratyay Mukherjee:
Cryptanalysis of Indistinguishability Obfuscations of Circuits over GGH13. IACR Cryptol. ePrint Arch. 2016: 1003 (2016) - 2015
- [j1]Rishiraj Bhattacharyya, Pratyay Mukherjee:
Non-adaptive programmability of random oracle. Theor. Comput. Sci. 592: 97-114 (2015) - [c5]Ivan Damgård, Sebastian Faust, Pratyay Mukherjee, Daniele Venturi:
The Chaining Lemma and Its Application. ICITS 2015: 181-196 - [c4]Sebastian Faust, Pratyay Mukherjee, Jesper Buus Nielsen, Daniele Venturi:
A Tamper and Leakage Resilient von Neumann Architecture. Public Key Cryptography 2015: 579-603 - [i7]Nishanth Chandran, Vipul Goyal, Pratyay Mukherjee, Omkant Pandey, Jalaj Upadhyay:
Block-wise Non-Malleable Codes. IACR Cryptol. ePrint Arch. 2015: 129 (2015) - [i6]Pratyay Mukherjee, Daniel Wichs:
Two Round MPC from LWE via Multi-Key FHE. IACR Cryptol. ePrint Arch. 2015: 345 (2015) - 2014
- [c3]Sebastian Faust, Pratyay Mukherjee, Daniele Venturi, Daniel Wichs:
Efficient Non-malleable Codes and Key-Derivation for Poly-size Tampering Circuits. EUROCRYPT 2014: 111-128 - [c2]Sebastian Faust, Pratyay Mukherjee, Jesper Buus Nielsen, Daniele Venturi:
Continuous Non-malleable Codes. TCC 2014: 465-488 - [i5]Sebastian Faust, Pratyay Mukherjee, Jesper Buus Nielsen, Daniele Venturi:
Continuous Non-malleable Codes. IACR Cryptol. ePrint Arch. 2014: 173 (2014) - [i4]Sebastian Faust, Pratyay Mukherjee, Jesper Buus Nielsen, Daniele Venturi:
A Tamper and Leakage Resilient Random Access Machine. IACR Cryptol. ePrint Arch. 2014: 338 (2014) - [i3]Ivan Damgård, Sebastian Faust, Pratyay Mukherjee, Daniele Venturi:
The Chaining Lemma and its application. IACR Cryptol. ePrint Arch. 2014: 979 (2014) - 2013
- [c1]Ivan Damgård, Sebastian Faust, Pratyay Mukherjee, Daniele Venturi:
Bounded Tamper Resilience: How to Go beyond the Algebraic Barrier. ASIACRYPT (2) 2013: 140-160 - [i2]Ivan Damgård, Sebastian Faust, Pratyay Mukherjee, Daniele Venturi:
Bounded Tamper Resilience: How to go beyond the Algebraic Barrier. IACR Cryptol. ePrint Arch. 2013: 677 (2013) - [i1]Sebastian Faust, Pratyay Mukherjee, Daniele Venturi, Daniel Wichs:
Efficient Non-Malleable Codes and Key-Derivation for Poly-Size Tampering Circuits. IACR Cryptol. ePrint Arch. 2013: 702 (2013)
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-11 22:24 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:
