Manoj Prabhakaran

Rajeev Raghunath

Parjanya Vyas

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

2020

Zero-Communication Reductions.

[BibT_eX]

[DOI]

Varun Narayanan

Proceedings of the Theory of Cryptography - 18th International Conference, 2020

Witness Maps and Applications.

[BibT_eX]

[DOI]

Suvradip Chakraborty

Daniel Wichs

Proceedings of the Public-Key Cryptography - PKC 2020, 2020

A Practical Model for Collaborative Databases: Securely Mixing, Searching and Computing.

[BibT_eX]

[DOI]

Proceedings of the Computer Security - ESORICS 2020, 2020

Cryptography from One-Way Communication: On Completeness of Finite Channels.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2020, 2020

2019

CellTree: A New Paradigm for Distributed Data Repositories.

[BibT_eX]

[DOI]

Anasuya Acharya

Akash Trehan

IACR Cryptol. ePrint Arch., 2019

Optimality of a Protocol by Feige-Kilian-Naor for Three-Party Secure Computation.

[BibT_eX]

[DOI]

Proceedings of the Progress in Cryptology - INDOCRYPT 2019, 2019

An Introduction to the CellTree Paradigm (Invited Paper).

[BibT_eX]

[DOI]

Anasuya Acharya

Akash Trehan

Proceedings of the Information Systems Security - 15th International Conference, 2019

Uncovering Algebraic Structures in the MPC Landscape.

[BibT_eX]

[DOI]

Navneet Agarwal

Sanat Anand

Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019

2018

Towards Characterizing Securely Computable Two-Party Randomized Functions.

[BibT_eX]

[DOI]

Deepesh Data

Proceedings of the Public-Key Cryptography - PKC 2018, 2018

The Bottleneck Complexity of Secure Multiparty Computation.

[BibT_eX]

[DOI]

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Brief Announcement: On Secure m-Party Computation, Commuting Permutation Systems and Unassisted Non-Interactive MPC.

[BibT_eX]

[DOI]

Navneet Agarwal

Sanat Anand

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017

Reconciling Non-malleability with Homomorphic Encryption.

[BibT_eX]

[DOI]

J. Cryptol., 2017

2016

Communication and Randomness Lower Bounds for Secure Computation.

[BibT_eX]

[DOI]

Deepesh Data

Manoj M. Prabhakaran

IEEE Trans. Inf. Theory, 2016

Virtual Grey-Boxes Beyond Obfuscation: A Statistical Security Notion for Cryptographic Agents.

[BibT_eX]

[DOI]

Ching-Hua Yu

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

Optimal Computational Split-state Non-malleable Codes.

[BibT_eX]

[DOI]

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

Rényi Information Complexity and an Information Theoretic Characterization of the Partition Bound.

[BibT_eX]

[DOI]

Manoj M. Prabhakaran

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

All Complete Functionalities are Reversible.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2016, 2016

Secure Protocol Transformations.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016

2015

Obfuscation-Based Non-black-box Simulation and Four Message Concurrent Zero Knowledge for NP.

[BibT_eX]

[DOI]

Omkant Pandey

Proceedings of the Theory of Cryptography - 12th Theory of Cryptography Conference, 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

On the Practical Security of Inner Product Functional Encryption.

[BibT_eX]

[DOI]

Saikrishna Badrinarayanan

Abishek Kumarasubramanian

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

Cryptographic Agents: Towards a Unified Theory of Computing on Encrypted Data.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2015, 2015

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

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

2014

Assisted Common Information With an Application to Secure Two-Party Sampling.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 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

Towards a Unified Theory of Cryptographic Agents.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

Explicit Non-Malleable Codes Resistant to Permutations.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2014

Tension Bounds for Information Complexity.

[BibT_eX]

[DOI]

CoRR, 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

Lower Bounds in the Hardware Token Model.

[BibT_eX]

[DOI]

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

Circuits resilient to additive attacks with applications to secure computation.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Theory of Computing, 2014

Dynamic Searchable Encryption via Blind Storage.

[BibT_eX]

[DOI]

Muhammad Naveed

Carl A. Gunter

Proceedings of the 2014 IEEE Symposium on Security and Privacy, 2014

Limits of random oracles in secure computation.

[BibT_eX]

[DOI]

Mohammad Mahmoody

Proceedings of the Innovations in Theoretical Computer Science, 2014

Secure Computation Using Leaky Tokens.

[BibT_eX]

[DOI]

Akshay Wadia

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

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

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2014, 2014

On the Communication Complexity of Secure Computation.

[BibT_eX]

[DOI]

Deepesh Data

Proceedings of the Advances in Cryptology - CRYPTO 2014, 2014

Controlled Functional Encryption.

[BibT_eX]

[DOI]

Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, 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

Function Private Functional Encryption and Property Preserving Encryption : New Definitions and Positive Results.

[BibT_eX]

[DOI]

Saikrishna Badrinarayanan

Abishek Kumarasubramanian

IACR Cryptol. ePrint Arch., 2013

Robust Pseudorandom Generators.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

On Fair Exchange, Fair Coins and Fair Sampling.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

2012

On secure multiparty sampling for more than two parties.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE Information Theory Workshop, 2012

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

[BibT_eX]

[DOI]

Proceedings of the Progress in Cryptology, 2012

New Impossibility Results for Concurrent Composition and a Non-interactive Completeness Theorem for Secure Computation.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2012, 2012

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

Assisted common information: Further results.

[BibT_eX]

[DOI]

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

The Limits of Common Coins: Further Results.

[BibT_eX]

[DOI]

Proceedings of the Progress in Cryptology - INDOCRYPT 2011, 2011

Efficient Non-interactive Secure Computation.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2011, 2011

Attribute-Based Signatures.

[BibT_eX]

[DOI]

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

Constant-Rate Oblivious Transfer from Noisy Channels.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2011, 2011

2010

Attribute-Based Messaging: Access Control and Confidentiality.

[BibT_eX]

[DOI]

ACM Trans. Inf. Syst. Secur., 2010

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

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2010

Assisted Common Information with Applications to Secure Two-Party Computation

[BibT_eX]

[DOI]

CoRR, 2010

Assisted common information.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 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]

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

Secure Arithmetic Computation with No Honest Majority.

[BibT_eX]

[DOI]

Yuval Ishai

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

Attribute-Sets: A Practically Motivated Enhancement to Attribute-Based Encryption.

[BibT_eX]

[DOI]

Rakeshbabu Bobba

Himanshu Khurana

Proceedings of the Computer Security, 2009

Statistically Hiding Sets.

[BibT_eX]

[DOI]

Rui Xue

Proceedings of the Topics in Cryptology, 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

Homomorphic Encryption with CCA Security.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Cryptographic Complexity of Multi-Party Computation Problems: Classifications and Separations.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2008

Founding Cryptography on Oblivious Transfer - Efficiently.

[BibT_eX]

[DOI]

Yuval Ishai

Proceedings of the Advances in Cryptology, 2008

Towards Robust Computation on Encrypted Data.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2008

2007

Rerandomizable RCCA Encryption.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2007

2006

Resource Fairness and Composability of Cryptographic Protocols.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography, Third Theory of Cryptography Conference, 2006

Concurrent Non-Malleable Zero Knowledge.

[BibT_eX]

[DOI]

Boaz Barak