Aishwarya Thiruvengadam

According to our database1, Aishwarya Thiruvengadam authored at least 14 papers between 2012 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Byzantine Resilient Distributed Computing on External Data.
Proceedings of the 38th International Symposium on Distributed Computing, 2024

2023
Byzantine Resilient Computing with the Cloud.
CoRR, 2023

2018
The Multi-user Security of GCM, Revisited: Tight Bounds for Nonce Randomization.
IACR Cryptol. ePrint Arch., 2018

Provable Time-Memory Trade-Offs: Symmetric Cryptography Against Memory-Bounded Adversaries.
Proceedings of the Theory of Cryptography - 16th International Conference, 2018

Provable Security of (Tweakable) Block Ciphers Based on Substitution-Permutation Networks.
Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

2017
Improving the Round Complexity of Ideal-Cipher Constructions.
PhD thesis, 2017

Provable Security of Substitution-Permutation Networks.
IACR Cryptol. ePrint Arch., 2017

Five Rounds are Sufficient and Necessary for the Indifferentiability of Iterated Even-Mansour.
IACR Cryptol. ePrint Arch., 2017

Indifferentiability of Iterated Even-Mansour Ciphers with Non-idealized Key-Schedules: Five Rounds Are Necessary and Sufficient.
Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

2015
Feasibility and Infeasibility of Adaptively Secure Fully Homomorphic Encryption.
IACR Cryptol. ePrint Arch., 2015

10-Round Feistel is Indifferentiable from an Ideal Cipher.
IACR Cryptol. ePrint Arch., 2015

Hash Functions from Defective Ideal Ciphers.
Proceedings of the Topics in Cryptology, 2015

2014
Verifiable Oblivious Storage.
IACR Cryptol. ePrint Arch., 2014

2012
Byzantine Agreement with a Rational Adversary.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012


  Loading...