Vipul Goyal

According to our database1, Vipul Goyal authored at least 93 papers between 2004 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Correlated-Source Extractors and Cryptography with Correlated-Random Tapes.
IACR Cryptology ePrint Archive, 2019

Non-Malleable Commitments Using Goldreich-Levin List Decoding.
IACR Cryptology ePrint Archive, 2019

Communication-Efficient Unconditional MPC with Guaranteed Output Delivery.
IACR Cryptology ePrint Archive, 2019

Simultaneous Amplification: The Case of Non-Interactive Zero-Knowledge.
IACR Cryptology ePrint Archive, 2019

Founding Secure Computation on Blockchains.
IACR Cryptology ePrint Archive, 2019

On Round Optimal Secure Multiparty Computation from Minimal Assumptions.
IACR Cryptology ePrint Archive, 2019

Interactive Non-malleable Codes.
Proceedings of the Theory of Cryptography - 17th International Conference, 2019

2018
Non-Malleable Secret Sharing for General Access Structures.
IACR Cryptology ePrint Archive, 2018

Non-Malleable Secret Sharing.
IACR Cryptology ePrint Archive, 2018

On the Existence of Three Round Zero-Knowledge Proofs.
IACR Cryptology ePrint Archive, 2018

Predicting the Algorithmic Time Complexity of Single Parametric Algorithms Using Multiclass Classification with Gradient Boosted Trees.
Proceedings of the 2018 Eleventh International Conference on Contemporary Computing, 2018

2017
Overcoming Cryptographic Impossibility Results using Blockchains.
IACR Cryptology ePrint Archive, 2017

Promise Zero Knowledge and its Applications to Round Optimal MPC.
IACR Cryptology ePrint Archive, 2017

Round Optimal Concurrent MPC via Strong Simulation.
IACR Cryptology ePrint Archive, 2017

A note on VRFs from Verifiable Functional Encryption.
IACR Cryptology ePrint Archive, 2017

HOP: Hardware makes Obfuscation Practical.
Proceedings of the 24th Annual Network and Distributed System Security Symposium, 2017

Hierarchical Functional Encryption.
Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017

2016
Verifiable Functional Encryption.
IACR Cryptology ePrint Archive, 2016

Breaking the Three Round Barrier for Non-malleable Commitments.
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

Bounded-Communication Leakage Resilience via Parity-Resilient Circuits.
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

2015
Textbook Non-Malleable Commitments.
IACR Cryptology ePrint Archive, 2015

Do Distributed Differentially-Private Protocols Require Oblivious Transfer?
IACR Cryptology ePrint Archive, 2015

Multi-Input Functional Encryption with Unbounded-Message Security.
IACR Cryptology ePrint Archive, 2015

Witness Signatures and Non-Malleable Multi-Prover Zero-Knowledge Proofs.
IACR Cryptology ePrint Archive, 2015

Concurrent Secure Computation via Non-Black Box Simulation.
IACR Cryptology ePrint Archive, 2015

On Concurrently Secure Computation in the Multiple Ideal Query Model.
IACR Cryptology ePrint Archive, 2015

What Information is Leaked under Concurrent Composition?
IACR Cryptology ePrint Archive, 2015

Block-wise Non-Malleable Codes.
IACR Cryptology ePrint Archive, 2015

Functional Encryption: Decentralised and Delegatable.
IACR Cryptology ePrint Archive, 2015

Concurrent Secure Computation with Optimal Query Complexity.
IACR Cryptology ePrint Archive, 2015

Non-Malleable Extractors and Codes, with their Many Tampered Extensions.
Electronic Colloquium on Computational Complexity (ECCC), 2015

Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma.
Proceedings of the Theory of Cryptography - 12th Theory of Cryptography Conference, 2015

Fast Non-Malleable Commitments.
Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, 2015

2014
An Algebraic Approach to Non-Malleability.
IACR Cryptology ePrint Archive, 2014

Black-Box Non-Black-Box Zero Knowledge.
IACR Cryptology ePrint Archive, 2014

Interactive Proofs under Continual Memory Leakage.
IACR Cryptology ePrint Archive, 2014

Lower Bounds in the Hardware Token Model.
Proceedings of the Theory of Cryptography - 11th Theory of Cryptography Conference, 2014

Achieving Privacy in Verifiable Computation with Multiple Servers - Without FHE and without Pre-processing.
Proceedings of the Public-Key Cryptography - PKC 2014, 2014

Multi-input Functional Encryption.
Proceedings of the Advances in Cryptology - EUROCRYPT 2014, 2014

2013
Functional Encryption for Randomized Functionalities.
IACR Cryptology ePrint Archive, 2013

Multi-Input Functional Encryption.
IACR Cryptology ePrint Archive, 2013

Lower Bounds in the Hardware Token Model.
IACR Cryptology ePrint Archive, 2013

Concurrent Zero Knowledge in the Bounded Player Model.
Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

On the (In)security of Fischlin's Paradigm.
Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

Non-black-box simulation in the fully concurrent setting.
Proceedings of the Symposium on Theory of Computing Conference, 2013

Accuracy-Privacy Tradeoffs for Two-Party Differentially Private Protocols.
Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

Constant-Round Concurrent Zero Knowledge in the Bounded Player Model.
Proceedings of the Advances in Cryptology - ASIACRYPT 2013, 2013

2012
Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma.
IACR Cryptology ePrint Archive, 2012

Identity-based Encryption with Efficient Revocation.
IACR Cryptology ePrint Archive, 2012

On the (In)security of Fischlin's Paradigm.
IACR Cryptology ePrint Archive, 2012

New Impossibility Results for Concurrent Composition and a Non-Interactive Completeness Theorem for Secure Computation.
IACR Cryptology ePrint Archive, 2012

On Black-Box Reductions between Predicate Encryption Schemes.
Proceedings of the Theory of Cryptography - 9th Theory of Cryptography Conference, 2012

On-Line/Off-Line Leakage Resilient Secure Computation Protocols.
Proceedings of the Progress in Cryptology, 2012

Constructing Non-malleable Commitments: A Black-Box Approach.
Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

2011
Correlated-Input Secure Hash Functions.
IACR Cryptology ePrint Archive, 2011

Positive Results for Concurrently Secure Computation in the Plain Model.
IACR Cryptology ePrint Archive, 2011

Concurrently Secure Computation in Constant Rounds.
IACR Cryptology ePrint Archive, 2011

Resettable Cryptography in Constant Rounds - the Case of Zero Knowledge.
IACR Cryptology ePrint Archive, 2011

Noiseless Database Privacy.
IACR Cryptology ePrint Archive, 2011

CompChall: Addressing Password Guessing Attacks
CoRR, 2011

Bringing People of Different Beliefs Together to Do UC.
Proceedings of the Theory of Cryptography - 8th Theory of Cryptography Conference, 2011

Secure Composition of Cryptographic Protocols.
Proceedings of the Information Systems Security - 7th International Conference, 2011

Stateless Cryptographic Protocols.
Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

2010
Founding Cryptography on Tamper-Proof Hardware Tokens.
IACR Cryptology ePrint Archive, 2010

Constant Round Non-Malleable Protocols using One Way Functions.
IACR Cryptology ePrint Archive, 2010

On the Round Complexity of Covert Computation.
IACR Cryptology ePrint Archive, 2010

Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography.
Electronic Colloquium on Computational Complexity (ECCC), 2010

Position-Based Quantum Cryptography: Impossibility and Constructions
CoRR, 2010

Vcache: Caching Dynamic Documents
CoRR, 2010

Password-Authenticated Session-Key Generation on the Internet in the Plain Model.
Proceedings of the Advances in Cryptology, 2010

2009
Position Based Cryptography.
IACR Cryptology ePrint Archive, 2009

Resolving the Simultaneous Resettability Conjecture and a New Non-Black-Box Simulation Strategy.
Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009

Resettably Secure Computation.
Proceedings of the Advances in Cryptology, 2009

2008
Resolving the Simultaneous Resettability Conjecture and a New Non-Black-Box Simulation Strategy.
IACR Cryptology ePrint Archive, 2008

Bounded Ciphertext Policy Attribute Based Encryption.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Efficient Two Party and Multi Party Computation Against Covert Adversaries.
Proceedings of the Advances in Cryptology, 2008

Black-box accountable authority identity-based encryption.
Proceedings of the 2008 ACM Conference on Computer and Communications Security, 2008

2007
Universally Composable Multi-Party Computation with an Unreliable Common Reference String.
IACR Cryptology ePrint Archive, 2007

Reducing Trust in the PKG in Identity Based Cryptosystems.
IACR Cryptology ePrint Archive, 2007

New Constructions for UC Secure Computation using Tamper-proof Hardware.
IACR Cryptology ePrint Archive, 2007

Covert Multi-Party Computation.
Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), 2007

Certificate Revocation Using Fine Grained Certificate Space Partitioning.
Proceedings of the Financial Cryptography and Data Security, 2007

2006
Attribute-Based Encryption for Fine-Grained Access Control of Encrypted Data.
IACR Cryptology ePrint Archive, 2006

Concurrent Statistical Zero-Knowledge Arguments for NP from One Way Functions.
IACR Cryptology ePrint Archive, 2006

A new protocol to counter online dictionary attacks.
Computers & Security, 2006

2005
The N/R One Time Password System.
Proceedings of the International Symposium on Information Technology: Coding and Computing (ITCC 2005), 2005

Improvements to Mitchell's Remote User Authentication Protocol.
Proceedings of the Information Security and Cryptology, 2005

An Efficient Solution to the ARP Cache Poisoning Problem.
Proceedings of the Information Security and Privacy, 10th Australasian Conference, 2005

2004
Construction and Traversal of Hash Chain with Public Links.
IACR Cryptology ePrint Archive, 2004

More Efficient Server Assisted One Time Signatures.
IACR Cryptology ePrint Archive, 2004

How To Re-initialize a Hash Chain.
IACR Cryptology ePrint Archive, 2004

Certificate Revocation Lists or Online Mechanisms.
Proceedings of the Security In Information Systems, 2004

Fast Digital Certificate Revocation.
Proceedings of the Security and Protection in Information Processing Systems, 2004


  Loading...