Divya Gupta

According to our database1, Divya Gupta authored at least 23 papers between 2012 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2019
Explicit Rate-1 Non-malleable Codes for Local Tampering.
Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

2018
Secure Computation using Leaky Correlations (Asymptotically Optimal Constructions).
IACR Cryptol. ePrint Arch., 2018

Non-malleable Codes Against Lookahead Tampering.
Proceedings of the Progress in Cryptology - INDOCRYPT 2018, 2018

2017
Laconic Oblivious Transfer and its Applications.
IACR Cryptol. ePrint Arch., 2017

Constant-rate Non-malleable Codes in the Split-state Model.
IACR Cryptol. ePrint Arch., 2017

2016
Program Obfuscation: Applications and Optimizations.
PhD thesis, 2016

Secure Multiparty RAM Computation in Constant Rounds.
IACR Cryptol. ePrint Arch., 2016

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

2015
Concurrent Secure Computation via Non-Black Box Simulation.
IACR Cryptol. ePrint Arch., 2015

What Information is Leaked under Concurrent Composition?
IACR Cryptol. ePrint Arch., 2015

Multi-Input Functional Encryption for Unbounded Arity Functions.
IACR Cryptol. ePrint Arch., 2015

Optimal Computational Split-state Non-malleable Codes.
IACR Cryptol. ePrint Arch., 2015

A Rate-Optimizing Compiler for Non-malleable Codes Against Bit-Wise Tampering and Permutations.
Proceedings of the Theory of Cryptography - 12th Theory of Cryptography Conference, 2015

Hosting Services on an Untrusted Cloud.
Proceedings of the Advances in Cryptology - EUROCRYPT 2015, 2015

Explicit Non-malleable Codes Against Bit-Wise Tampering and Permutations.
Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

Secure Computation from Leaky Correlated Randomness.
Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

2014
Efficient Round Optimal Blind Signatures.
IACR Cryptol. ePrint Arch., 2014

Optimizing Obfuscation: Avoiding Barrington's Theorem.
IACR Cryptol. ePrint Arch., 2014

Explicit Optimal-Rate Non-malleable Codes Against Bit-wise Tampering and Permutations.
IACR Cryptol. ePrint Arch., 2014

Explicit Non-malleable Codes Resistant to Permutations and Perturbations.
IACR Cryptol. ePrint Arch., 2014

Explicit Non-Malleable Codes Resistant to Permutations.
Electronic Colloquium on Computational Complexity (ECCC), 2014

2012
On Constant-Round Concurrent Zero-Knowledge from a Knowledge Assumption.
IACR Cryptol. ePrint Arch., 2012

Approximation Algorithms for the Unsplittable Flow Problem on Paths and Trees.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012


  Loading...