Vipul Goyal

Chen-Da Liu-Zhang

Proceedings of the Advances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30, 2022

Sharing Transformation and Dishonest Majority MPC with Packed Secret Sharing.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

Tight Bounds on the Randomness Complexity of Secure Multiparty Computation.

[BibT_eX]

[DOI]

Yuval Ishai

Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

TurboPack: Honest Majority MPC with Constant Online Communication.

[BibT_eX]

[DOI]

Daniel Escudero

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

2021

An Algebraic Approach to Nonmalleability.

[BibT_eX]

[DOI]

SIAM J. Comput., 2021

Blockchains Enable Non-interactive MPC.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 19th International Conference, 2021

Oblivious Transfer from Trapdoor Permutations in Minimal Rounds.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 19th International Conference, 2021

Two-Round Maliciously Secure Computation with Super-Polynomial Simulation.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 19th International Conference, 2021

Instant Block Confirmation in the Sleepy Model.

[BibT_eX]

[DOI]

Hanjun Li

Justin Raizes

Proceedings of the Financial Cryptography and Data Security, 2021

Cryptocurrencies with Security Policies and Two-Factor Authentication.

[BibT_eX]

[DOI]

Florian Breuer

Giulio Malavolta

Proceedings of the IEEE European Symposium on Security and Privacy, 2021

Multi-source Non-malleable Extractors and Applications.

[BibT_eX]

[DOI]

Akshayaram Srinivasan

Chenzhi Zhu

Proceedings of the Advances in Cryptology - EUROCRYPT 2021, 2021

Threshold Garbled Circuits and Ad Hoc Secure Computation.

[BibT_eX]

[DOI]

Michele Ciampi

Rafail Ostrovsky

Proceedings of the Advances in Cryptology - EUROCRYPT 2021, 2021

Towards Accountability in CRS Generation.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2021, 2021

Post-Quantum Multi-Party Computation.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2021, 2021

Traceable Secret Sharing and Applications.

[BibT_eX]

[DOI]

Akshayaram Srinivasan

Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

Unconditional Communication-Efficient MPC via Hall's Marriage Theorem.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

ATLAS: Efficient and Scalable MPC in the Honest Majority Setting.

[BibT_eX]

[DOI]

Hanjun Li

Rafail Ostrovsky

Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

ACCO: Algebraic Computation with Comparison.

[BibT_eX]

[DOI]

Proceedings of the CCSW@CCS '21: Proceedings of the 2021 on Cloud Computing Security Workshop, 2021

2020

Nonmalleable Extractors and Codes, with Their Many Tampered Extensions.

[BibT_eX]

[DOI]

Eshan Chattopadhyay

Xin Li

SIAM J. Comput., 2020

Malicious Security Comes Free in Honest-Majority MPC.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Leakage-Resilient Extractors and Secret-Sharing against Bounded Collusion Protocols.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2020

Post-Quantum Multi-Party Computation in Constant Rounds.

[BibT_eX]

[DOI]

CoRR, 2020

Round Optimal Secure Multiparty Computation from Minimal Assumptions.

[BibT_eX]

[DOI]

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

Extractors for adversarial sources via extremal hypergraphs.

[BibT_eX]

[DOI]

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

The Round Complexity of Secure Computation Against Covert Adversaries.

[BibT_eX]

[DOI]

Arka Rai Choudhuri

Proceedings of the Security and Cryptography for Networks - 12th International Conference, 2020

Extractors and Secret Sharing Against Bounded Collusion Protocols.

[BibT_eX]

[DOI]

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

Statistical Zaps and New Oblivious Transfer Protocols.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2020, 2020

Guaranteed Output Delivery Comes Free in Honest Majority MPC.

[BibT_eX]

[DOI]

Chenzhi Zhu

Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

Talek: Private Group Messaging with Hidden Access Patterns.

[BibT_eX]

[DOI]

Proceedings of the ACSAC '20: Annual Computer Security Applications Conference, 2020

2019

Interactive Non-malleable Codes.

[BibT_eX]

[DOI]

Nils Fleischhacker

Anat Paskin-Cherniavsky

Slava Radune

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

Non-Malleable Commitments using Goldreich-Levin List Decoding.

[BibT_eX]

[DOI]

Silas Richelson

Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

Laconic Conditional Disclosure of Secrets and Applications.

[BibT_eX]

[DOI]

Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

Correlated-Source Extractors and Cryptography with Correlated-Random Tapes.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019

Founding Secure Computation on Blockchains.

[BibT_eX]

[DOI]

Arka Rai Choudhuri

Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019

Communication-Efficient Unconditional MPC with Guaranteed Output Delivery.

[BibT_eX]

[DOI]

Yanyi Liu

Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

Simultaneous Amplification: The Case of Non-interactive Zero-Knowledge.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

2018

Non-malleable secret sharing.

[BibT_eX]

[DOI]

Ashutosh Kumar

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Predicting the Algorithmic Time Complexity of Single Parametric Algorithms Using Multiclass Classification with Gradient Boosted Trees.

[BibT_eX]

[DOI]

Proceedings of the 2018 Eleventh International Conference on Contemporary Computing, 2018

On the Existence of Three Round Zero-Knowledge Proofs.

[BibT_eX]

[DOI]

Nils Fleischhacker

Proceedings of the Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29, 2018

Non-malleable Secret Sharing for General Access Structures.

[BibT_eX]

[DOI]

Ashutosh Kumar

Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

Promise Zero Knowledge and Its Applications to Round Optimal MPC.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

2017

A note on VRFs from Verifiable Functional Encryption.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

Overcoming Cryptographic Impossibility Results Using Blockchains.

[BibT_eX]

[DOI]

Rishab Goyal

Proceedings of the Theory of Cryptography - 15th International Conference, 2017

Round Optimal Concurrent MPC via Strong Simulation.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 15th International Conference, 2017

HOP: Hardware makes Obfuscation Practical.

[BibT_eX]

[DOI]

Kartik Nayak

Christopher W. Fletcher

Proceedings of the 24th Annual Network and Distributed System Security Symposium, 2017

Hierarchical Functional Encryption.

[BibT_eX]

[DOI]

Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017

2016

Textbook non-malleable commitments.

[BibT_eX]

[DOI]

Omkant Pandey

Silas Richelson

Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

Non-malleable extractors and codes, with their many tampered extensions.

[BibT_eX]

[DOI]

Eshan Chattopadhyay

Xin Li

Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

Do Distributed Differentially-Private Protocols Require Oblivious Transfer?.

[BibT_eX]

[DOI]

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

Block-Wise Non-Malleable Codes.

[BibT_eX]

[DOI]

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

Breaking the Three Round Barrier for Non-malleable Commitments.

[BibT_eX]

[DOI]

Dakshita Khurana

Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 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

Multi-input Functional Encryption with Unbounded-Message Security.

[BibT_eX]

[DOI]

Adam O'Neill

Proceedings of the Advances in Cryptology - ASIACRYPT 2016, 2016

Verifiable Functional Encryption.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2016, 2016

2015

Witness Signatures and Non-Malleable Multi-Prover Zero-Knowledge Proofs.

[BibT_eX]

[DOI]

Dakshita Khurana

IACR Cryptol. ePrint Arch., 2015

Functional Encryption: Decentralised and Delegatable.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma.

[BibT_eX]

[DOI]

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

Functional Encryption for Randomized Functionalities.

[BibT_eX]

[DOI]

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

Concurrent Secure Computation via Non-Black Box Simulation.

[BibT_eX]

[DOI]

Divya Gupta

Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

Concurrent Secure Computation with Optimal Query Complexity.

[BibT_eX]

[DOI]

Ran Canetti

Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

Fast Non-Malleable Commitments.

[BibT_eX]

[DOI]

Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, 2015

2014

Lower Bounds in the Hardware Token Model.

[BibT_eX]

[DOI]

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

Black-box non-black-box zero knowledge.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Theory of Computing, 2014

Achieving Privacy in Verifiable Computation with Multiple Servers - Without FHE and without Pre-processing.

[BibT_eX]

[DOI]

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

An Algebraic Approach to Non-malleability.

[BibT_eX]

[DOI]

Proceedings of the 55th IEEE Annual Symposium on Foundations of Computer Science, 2014

Multi-input Functional Encryption.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2014, 2014

Interactive Proofs under Continual Memory Leakage.

[BibT_eX]

[DOI]

Prabhanjan Ananth

Omkant Pandey

Proceedings of the Advances in Cryptology - CRYPTO 2014, 2014

2013

Multi-Input Functional Encryption.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2013

Concurrent Zero Knowledge in the Bounded Player Model.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

On the (In)security of Fischlin's Paradigm.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

Non-black-box simulation in the fully concurrent setting.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Theory of Computing Conference, 2013

On Concurrently Secure Computation in the Multiple Ideal Query Model.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2013

Accuracy-Privacy Tradeoffs for Two-Party Differentially Private Protocols.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

What Information Is Leaked under Concurrent Composition?

[BibT_eX]

[DOI]

Divya Gupta

Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

Constant-Round Concurrent Zero Knowledge in the Bounded Player Model.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2013, 2013

2012

Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma.

[BibT_eX]

[DOI]

Omkant Pandey

IACR Cryptol. ePrint Arch., 2012

On Black-Box Reductions between Predicate Encryption Schemes.

[BibT_eX]

[DOI]

Virendra Kumar

Satyanarayana V. Lokam

Mohammad Mahmoody

Proceedings of the Theory of Cryptography - 9th Theory of Cryptography Conference, 2012

On-Line/Off-Line Leakage Resilient Secure Computation Protocols.

[BibT_eX]

[DOI]

Chaya Ganesh

Satyanarayana V. Lokam

Proceedings of the Progress in Cryptology, 2012

Constructing Non-malleable Commitments: A Black-Box Approach.

[BibT_eX]

[DOI]

Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

Positive Results for Concurrently Secure Computation in the Plain Model.

[BibT_eX]

[DOI]

Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

Concurrently Secure Computation in Constant Rounds.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2012, 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

Correlated-Input Secure Hash Functions.

[BibT_eX]

[DOI]

Adam O'Neill

Vanishree Rao

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

Bringing People of Different Beliefs Together to Do UC.

[BibT_eX]

[DOI]

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

Constant round non-malleable protocols using one way functions.

[BibT_eX]

[DOI]

Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

Secure Composition of Cryptographic Protocols.

[BibT_eX]

[DOI]

Proceedings of the Information Systems Security - 7th International Conference, 2011

Stateless Cryptographic Protocols.

[BibT_eX]

[DOI]

Hemanta K. Maji

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

Position-Based Quantum Cryptography: Impossibility and Constructions.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2011, 2011

Resettable Cryptography in Constant Rounds - The Case of Zero Knowledge.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2011, 2011

Noiseless Database Privacy.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2011, 2011

2010

Vcache: Caching Dynamic Documents

[BibT_eX]

[DOI]

Sugata Sanyal

Dharma P. Agrawal

CoRR, 2010

Founding Cryptography on Tamper-Proof Hardware Tokens.

[BibT_eX]

[DOI]

Yuval Ishai

Ramarathnam Venkatesan

Akshay Wadia

Proceedings of the Theory of Cryptography, 7th Theory of Cryptography Conference, 2010

On the round complexity of covert computation.

[BibT_eX]

[DOI]

Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

Password-Authenticated Session-Key Generation on the Internet in the Plain Model.

[BibT_eX]

[DOI]

Rafail Ostrovsky

Proceedings of the Advances in Cryptology, 2010

Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2010

2009

Resolving the Simultaneous Resettability Conjecture and a New Non-Black-Box Simulation Strategy.

[BibT_eX]

[DOI]

Yi Deng

Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009

Resettably Secure Computation.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2009

Position Based Cryptography.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2009

2008

Resolving the Simultaneous Resettability Conjecture and a New Non-Black-Box Simulation Strategy.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2008

Universally Composable Multi-party Computation with an Unreliable Common Reference String.

[BibT_eX]

[DOI]

Jonathan Katz

Proceedings of the Theory of Cryptography, Fifth Theory of Cryptography Conference, 2008

Bounded Ciphertext Policy Attribute Based Encryption.

[BibT_eX]

[DOI]

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

Efficient Two Party and Multi Party Computation Against Covert Adversaries.

[BibT_eX]

[DOI]

Payman Mohassel

Adam D. Smith

Proceedings of the Advances in Cryptology, 2008

New Constructions for UC Secure Computation Using Tamper-Proof Hardware.

[BibT_eX]

[DOI]

Nishanth Chandran

Proceedings of the Advances in Cryptology, 2008

Black-box accountable authority identity-based encryption.

[BibT_eX]

[DOI]

Proceedings of the 2008 ACM Conference on Computer and Communications Security, 2008

Identity-based encryption with efficient revocation.

[BibT_eX]

[DOI]

Alexandra Boldyreva

Virendra Kumar

Proceedings of the 2008 ACM Conference on Computer and Communications Security, 2008

2007

Covert Multi-Party Computation.

[BibT_eX]

[DOI]

Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, 2007

Certificate Revocation Using Fine Grained Certificate Space Partitioning.

[BibT_eX]

[DOI]

Proceedings of the Financial Cryptography and Data Security, 2007

Reducing Trust in the PKG in Identity Based Cryptosystems.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2007

Concurrent Statistical Zero-Knowledge Arguments for NP from One Way Functions.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2007

2006

A new protocol to counter online dictionary attacks.

[BibT_eX]

[DOI]

Comput. Secur., 2006

Attribute-based encryption for fine-grained access control of encrypted data.

[BibT_eX]

[DOI]

Proceedings of the 13th ACM Conference on Computer and Communications Security, 2006

2005

CompChall: Addressing Password Guessing Attacks.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Information Technology: Coding and Computing (ITCC 2005), 2005

The N/R One Time Password System.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Information Technology: Coding and Computing (ITCC 2005), 2005

Improvements to Mitchell's Remote User Authentication Protocol.

[BibT_eX]

[DOI]

Jean-Jacques Quisquater

Proceedings of the Information Security and Cryptology, 2005

An Efficient Solution to the ARP Cache Poisoning Problem.

[BibT_eX]

[DOI]

Rohit Tripathy

Proceedings of the Information Security and Privacy, 10th Australasian Conference, 2005

2004

Construction and Traversal of Hash Chain with Public Links.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2004

More Efficient Server Assisted One Time Signatures.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2004

How To Re-initialize a Hash Chain.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2004

Certificate Revocation Lists or Online Mechanisms.

[BibT_eX]

Proceedings of the Security In Information Systems, 2004

Fast Digital Certificate Revocation.

[BibT_eX]

[DOI]