Pratyay Mukherjee

Orcid: 0000-0002-0995-9555

According to our database1, Pratyay Mukherjee authored at least 46 papers between 2014 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
VRaaS: Verifiable Randomness as a Service on Blockchains.
IACR Cryptol. ePrint Arch., 2024

Insta-Pok3r: Real-time Poker on Blockchain.
IACR Cryptol. ePrint Arch., 2024

HiSE: Hierarchical (Threshold) Symmetric-key Encryption.
IACR Cryptol. ePrint Arch., 2024

Universally Composable Non-Interactive Zero-Knowledge from Sigma Protocols via a New Straight-line Compiler.
IACR Cryptol. ePrint Arch., 2024

Scalable Multiparty Computation from Non-linear Secret Sharing.
Proceedings of the Advances in Cryptology - CRYPTO 2024, 2024

2023
Non-interactive VSS using Class Groups and Application to DKG.
IACR Cryptol. ePrint Arch., 2023

FlexiRand: Output Private (Distributed) VRFs and Application to Blockchains.
IACR Cryptol. ePrint Arch., 2023

hinTS: Threshold Signatures with Silent Setup.
IACR Cryptol. ePrint Arch., 2023

Threshold Signatures in the Multiverse.
IACR Cryptol. ePrint Arch., 2023

Efficient Vehicle Routing Problem: A Machine Learning and Evolutionary Computation Approach.
Proceedings of the Companion Proceedings of the Conference on Genetic and Evolutionary Computation, 2023

2022
Cryptography with Weights: MPC, Encryption and Signatures.
IACR Cryptol. ePrint Arch., 2022

Efficient Threshold FHE with Application to Real-Time Systems.
IACR Cryptol. ePrint Arch., 2022

A More Complete Analysis of the Signal Double Ratchet Algorithm.
IACR Cryptol. ePrint Arch., 2022

Round-Optimal Oblivious Transfer and MPC from Computational CSIDH.
IACR Cryptol. ePrint Arch., 2022

Efficient and Tight Oblivious Transfer from PKE with Tight Multi-User Security.
IACR Cryptol. ePrint Arch., 2022

ParaDiSE: Efficient Threshold Authenticated Encryption in Fully Malicious Model.
IACR Cryptol. ePrint Arch., 2022

i-TiRE: Incremental Timed-Release Encryption or How to use Timed-Release Encryption on Blockchains?
Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022

2021
Amortized Threshold Symmetric-key Encryption.
IACR Cryptol. ePrint Arch., 2021

TEMP: Time-locked Encryption Made Practical.
IACR Cryptol. ePrint Arch., 2021

On the Round Complexity of Fully Secure Solitary MPC with Honest Majority.
IACR Cryptol. ePrint Arch., 2021

2020
Continuously Non-malleable Codes in the Split-State Model.
J. Cryptol., 2020

Adaptively secure Threshold Symmetric-key Encryption.
IACR Cryptol. ePrint Arch., 2020

Reusable Two-Round MPC from DDH.
IACR Cryptol. ePrint Arch., 2020

Game-Set-MATCH: Using Mobile Devices for Seamless External-Facing Biometric Matching.
IACR Cryptol. ePrint Arch., 2020

BETA: Biometric Enabled Threshold Authentication.
IACR Cryptol. ePrint Arch., 2020

Reusable Two-Round MPC from DDH.
Proceedings of the Theory of Cryptography - 18th International Conference, 2020

2019
Approximate Trapdoors for Lattices and Smaller Hash-and-Sign Signatures.
IACR Cryptol. ePrint Arch., 2019

Continuous Space-Bounded Non-Malleable Codes from Stronger Proofs-of-Space.
IACR Cryptol. ePrint Arch., 2019

2018
DiSE: Distributed Symmetric-key Encryption.
IACR Cryptol. ePrint Arch., 2018

PASTA: PASsword-based Threshold Authentication.
IACR Cryptol. ePrint Arch., 2018

2017
Bounded Tamper Resilience: How to Go Beyond the Algebraic Barrier.
J. Cryptol., 2017

Non-Malleable Codes for Space-Bounded Tampering.
IACR Cryptol. ePrint Arch., 2017

2016
Efficient Non-Malleable Codes and Key Derivation for Poly-Size Tampering Circuits.
IEEE Trans. Inf. Theory, 2016

Obfuscation without the Vulnerabilities of Multilinear Maps.
IACR Cryptol. ePrint Arch., 2016

The Exact Round Complexity of Secure Computation.
IACR Cryptol. ePrint Arch., 2016

Secure Obfuscation in a Weak Multilinear Map Model.
IACR Cryptol. ePrint Arch., 2016

Obfuscation from Low Noise Multilinear Maps.
IACR Cryptol. ePrint Arch., 2016

Cryptanalysis of Indistinguishability Obfuscations of Circuits over GGH13.
IACR Cryptol. ePrint Arch., 2016

Two Round Multiparty Computation via Multi-key FHE.
Proceedings of the Advances in Cryptology - EUROCRYPT 2016, 2016

2015
Non-adaptive programmability of random oracle.
Theor. Comput. Sci., 2015

Two Round MPC from LWE via Multi-Key FHE.
IACR Cryptol. ePrint Arch., 2015

Block-wise Non-Malleable Codes.
IACR Cryptol. ePrint Arch., 2015

A Tamper and Leakage Resilient von Neumann Architecture.
Proceedings of the Public-Key Cryptography - PKC 2015 - 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30, 2015

2014
A Tamper and Leakage Resilient Random Access Machine.
IACR Cryptol. ePrint Arch., 2014

Continuous Non-malleable Codes.
IACR Cryptol. ePrint Arch., 2014

The Chaining Lemma and its application.
IACR Cryptol. ePrint Arch., 2014


  Loading...