Divya Gupta

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2018
Secure Computation Using Leaky Correlations (Asymptotically Optimal Constructions).
Proceedings of the Theory of Cryptography - 16th International Conference, 2018

Obfuscation from Low Noise Multilinear Maps.
Proceedings of the Progress in Cryptology - INDOCRYPT 2018, 2018

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

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

Laconic Oblivious Transfer and Its Applications.
Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

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

Secure Multiparty RAM Computation in Constant Rounds.
Proceedings of the Theory of Cryptography - 14th International Conference, 2016

Optimal Computational Split-state Non-malleable Codes.
Proceedings of the Theory of Cryptography - 13th International Conference, 2016

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

Concurrent Secure Computation via Non-Black Box Simulation.
Proceedings of the Advances in Cryptology - CRYPTO 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

Multi-input Functional Encryption for Unbounded Arity Functions.
Proceedings of the Advances in Cryptology - ASIACRYPT 2015 - 21st International Conference on the Theory and Application of Cryptology and Information Security, Auckland, New Zealand, November 29, 2015

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

Explicit Non-malleable Codes Resistant to Permutations and Perturbations.
IACR Cryptology ePrint Archive, 2014

Explicit Non-Malleable Codes Resistant to Permutations.
IACR Cryptology ePrint Archive, 2014

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

On Constant-Round Concurrent Zero-Knowledge from a Knowledge Assumption.
Proceedings of the Progress in Cryptology - INDOCRYPT 2014, 2014

Efficient Round Optimal Blind Signatures.
Proceedings of the Advances in Cryptology - EUROCRYPT 2014, 2014

Optimizing Obfuscation: Avoiding Barrington's Theorem.
Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, 2014

2013
What Information Is Leaked under Concurrent Composition?
Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

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...