Hemanta K. Maji

Proceedings of the 3rd Conference on Information-Theoretic Cryptography, 2022

2021

Computational Hardness of Optimal FairComputation: Beyond Minicrypt.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

Polymath: Low-Latency MPC via Secure Polynomial Evaluations and its Applications.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

Decidability of Secure Non-interactive Simulation of Doubly Symmetric Binary Source.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

Computational Hardness of Collective Coin-Tossing Protocols.

[BibT_eX]

[DOI]

Entropy, 2021

Optimally-secure Coin-tossing against a Byzantine Adversary.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

Efficient Distributed Coin-tossing Protocols.

[BibT_eX]

[DOI]

Himanshi K. Mehta

Proceedings of the IEEE International Symposium on Information Theory, 2021

Lower Bounds for Leakage-Resilient Secret-Sharing Schemes against Probing Attacks.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

Leakage-Resilience of the Shamir Secret-Sharing Scheme Against Physical-Bit Leakages.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2021, 2021

Computational Hardness of Optimal Fair Computation: Beyond Minicrypt.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

Constructing Locally Leakage-Resilient Linear Secret-Sharing Schemes.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

P<sub>4</sub>-free Partition and Cover Numbers & Applications.

[BibT_eX]

[DOI]

Proceedings of the 2nd Conference on Information-Theoretic Cryptography, 2021

2020

On Leakage-Resilient Secret Sharing.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Design & Analysis of Optimal Coin-tossing: New Techniques.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Coin Tossing with Lazy Defense: Hardness of Computation Results.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Secure Non-interactive Simulation: Hardness & Feasibility.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

P<sub>4</sub>-free Partition and Cover Numbers.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Graphs with Tunable Chromatic Numbers for Parallel Coloring.

[BibT_eX]

[DOI]

Xin Cheng

Alex Pothen

Proceedings of the SIAM Workshop on Combinatorial Scientific Computing, 2020

Black-Box Use of One-Way Functions is Useless for Optimal Fair Coin-Tossing.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

2019

Estimating Gaps in Martingales and Applications to Coin-Tossing: Constructions and Hardness.

[BibT_eX]

[DOI]

Tamalika Mukherjee

Proceedings of the Theory of Cryptography - 17th International Conference, 2019

Explicit Rate-1 Non-malleable Codes for Local Tampering.

[BibT_eX]

[DOI]

Divya Gupta

Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

2018

Secure Computation Using Leaky Correlations (Asymptotically Optimal Constructions).

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 16th International Conference, 2018

Secure Computation with Constant Communication Overhead Using Multiplication Embeddings.

[BibT_eX]

[DOI]

Alexander R. Block

Proceedings of the Progress in Cryptology - INDOCRYPT 2018, 2018

Non-malleable Codes Against Lookahead Tampering.

[BibT_eX]

[DOI]

Divya Gupta

Proceedings of the Progress in Cryptology - INDOCRYPT 2018, 2018

2017

Constant-rate Non-malleable Codes in the Split-state Model.

[BibT_eX]

[DOI]

Divya Gupta

IACR Cryptol. ePrint Arch., 2017

Characterizing optimal security and round-complexity for secure OR evaluation.

[BibT_eX]

[DOI]

Amisha Jhanji

Raphael Arkady Meyer

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Secure Computation Based on Leaky Correlations: High Resilience Setting.

[BibT_eX]

[DOI]

Alexander R. Block

Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

2016

Optimal Computational Split-state Non-malleable Codes.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 13th International Conference, 2016

Bounded-Communication Leakage Resilience via Parity-Resilient Circuits.

[BibT_eX]

[DOI]

Alexander A. Sherstov

Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

Secure Computation from Elastic Noisy Channels.

[BibT_eX]

[DOI]

Dakshita Khurana

Amit Sahai

Proceedings of the Advances in Cryptology - EUROCRYPT 2016, 2016

All Complete Functionalities are Reversible.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2016, 2016

On the Security and Usability of Segment-based Visual Cryptographic Authentication Protocols.

[BibT_eX]

[DOI]

Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016

2015

A Rate-Optimizing Compiler for Non-malleable Codes Against Bit-Wise Tampering and Permutations.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 12th Theory of Cryptography Conference, 2015

Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

Explicit Non-malleable Codes Against Bit-Wise Tampering and Permutations.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

Secure Computation from Leaky Correlated Randomness.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

2014

Zeroizing without zeroes: Cryptanalyzing multilinear maps without encodings of zero.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

Explicit Optimal-Rate Non-malleable Codes Against Bit-wise Tampering and Permutations.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

Explicit Non-malleable Codes Resistant to Permutations and Perturbations.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

Explicit Non-Malleable Codes Resistant to Permutations.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2014

On the Power of Public-Key Encryption in Secure Computation.

[BibT_eX]

[DOI]

Mohammad Mahmoody

Proceedings of the Theory of Cryptography - 11th Theory of Cryptography Conference, 2014

Single-use ot combiners with near-optimal resilience.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Limits of random oracles in secure computation.

[BibT_eX]

[DOI]

Mohammad Mahmoody

Proceedings of the Innovations in Theoretical Computer Science, 2014

A Full Characterization of Completeness for Two-Party Randomized Function Evaluation.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2014, 2014

Black-Box Separations for Differentially Private Protocols.

[BibT_eX]

[DOI]

Dakshita Khurana

Amit Sahai

Proceedings of the Advances in Cryptology - ASIACRYPT 2014, 2014

2013

Complexity of Multi-Party Computation Functionalities.

[BibT_eX]

[DOI]

Proceedings of the Secure Multi-Party Computation, 2013

Complexity of Multi-Party Computation Functionalities.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2013

2012

A Unified Characterization of Completeness and Triviality for Secure Function Evaluation.

[BibT_eX]

[DOI]

Proceedings of the Progress in Cryptology, 2012

2011

On computational intractability assumptions in cryptography

[BibT_eX]

[DOI]

PhD thesis, 2011

Exploring the Limits of Common Coins Using Frontier Analysis of Protocols.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 8th Theory of Cryptography Conference, 2011

The Limits of Common Coins: Further Results.

[BibT_eX]

[DOI]

Proceedings of the Progress in Cryptology - INDOCRYPT 2011, 2011

Stateless Cryptographic Protocols.

[BibT_eX]

[DOI]

Vipul Goyal

Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

Attribute-Based Signatures.

[BibT_eX]

[DOI]

Proceedings of the Topics in Cryptology - CT-RSA 2011, 2011

2010

A Zero-One Law for Deterministic 2-Party Secure Computation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2010

Cryptographic Complexity Classes and Computational Intractability Assumptions.

[BibT_eX]

[DOI]

Proceedings of the Innovations in Computer Science, 2010

On the Computational Complexity of Coin Flipping.

[BibT_eX]

[DOI]

Amit Sahai

Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010

A Zero-One Law for Cryptographic Complexity with Respect to Computational UC Security.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2010

2009

Complexity of Multi-party Computation Problems: The Case of 2-Party Symmetric Secure Function Evaluation.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography, 6th Theory of Cryptography Conference, 2009

2008

Complexity of Multiparty Computation Problems: The Case of 2-Party Symmetric Secure Function Evaluation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2008

Attribute-Based Signatures: Achieving Attribute-Privacy and Collusion-Resistance.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2008

2006

Computational Complexity of Statistical Machine Translation.

[BibT_eX]

[DOI]

Proceedings of the EACL 2006, 2006

2005

Theory of Alignment Generators and Applications to Statistical Machine Translation.

[BibT_eX]

[DOI]

Proceedings of the IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30, 2005

A New Decoding Algorithm for Statistical Machine Translation: Design and Implementation.

[BibT_eX]

[DOI]

Tanveer A. Faruquie

Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics, 2005

2004

An Algorithmic Framework for Solving the Decoding Problem in Statistical Machine Translation.

[BibT_eX]

[DOI]

Tanveer A. Faruquie

Proceedings of the COLING 2004, 2004

2003

Generic System to Evolve Memory and Recall Based Fuzzy Controllers for Anytime Learning.

[BibT_eX]