Aayush Jain

According to our database1, Aayush Jain authored at least 52 papers between 2013 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Lossy Cryptography from Code-Based Assumptions.
IACR Cryptol. ePrint Arch., 2024

Barrier Functions Inspired Reward Shaping for Reinforcement Learning.
CoRR, 2024

2023
Computational Wiretap Coding from Indistinguishability Obfuscation.
IACR Cryptol. ePrint Arch., 2023

Multi-Party Homomorphic Secret Sharing and Sublinear MPC from Sparse LPN.
IACR Cryptol. ePrint Arch., 2023

Quantum Key Leasing for PKE and FHE with a Classical Lessor.
IACR Cryptol. ePrint Arch., 2023

Hyperspectral Domain Adaptation for the Detection of Material Types in Recycling Streams at the Example of Electrolyzers.
Proceedings of the IEEE International Geoscience and Remote Sensing Symposium, 2023

2022
Polynomial-Time Cryptanalysis of the Subspace Flooding Assumption for Post-Quantum i풪.
IACR Cryptol. ePrint Arch., 2022

On the Optimal Succinctness and Efficiency of Functional Encryption and Attribute-Based Encryption.
IACR Cryptol. ePrint Arch., 2022

The Pseudorandom Oracle Model and Ideal Obfuscation.
IACR Cryptol. ePrint Arch., 2022

[Reproducibility Report] Path Planning using Neural A* Search.
CoRR, 2022

Indistinguishability Obfuscation from LPN over $\mathbb {F}_p$, DLIN, and PRGs in NC<sup>0</sup>.
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

2021
Indistinguishability Obfuscation from Well-Studied Assumptions.
PhD thesis, 2021

Indistinguishability Obfuscation from LPN over F_p, DLIN, and PRGs in NC^0.
IACR Cryptol. ePrint Arch., 2021

A Note on the Pseudorandomness of Low-Degree Polynomials over the Integers.
IACR Cryptol. ePrint Arch., 2021

Counterexamples to New Circular Security Assumptions Underlying iO.
IACR Cryptol. ePrint Arch., 2021

Maliciously-Secure MrNISC in the Plain Model.
IACR Cryptol. ePrint Arch., 2021

Multiparty Reusable Non-Interactive Secure Computation from LWE.
IACR Cryptol. ePrint Arch., 2021

Deep Learning based Differential Distinguisher for Lightweight Block Ciphers.
CoRR, 2021

2020
Combiners for Functional Encryption, Unconditionally.
IACR Cryptol. ePrint Arch., 2020

Amplifying the Security of Functional Encryption, Unconditionally.
IACR Cryptol. ePrint Arch., 2020

Deep Learning based Differential Distinguisher for Lightweight Cipher PRESENT.
IACR Cryptol. ePrint Arch., 2020

Indistinguishability Obfuscation from Simple-to-State Hard Problems: New Assumptions, New Techniques, and Simplification.
IACR Cryptol. ePrint Arch., 2020

Affine Determinant Programs: A Framework for Obfuscation and Witness Encryption.
IACR Cryptol. ePrint Arch., 2020

Indistinguishability Obfuscation from Well-Founded Assumptions.
Electron. Colloquium Comput. Complex., 2020

Performance analysis of non-banking finance companies using two-stage data envelopment analysis.
Ann. Oper. Res., 2020

SeekSuspect: retrieving suspects from criminal datasets using visual memory.
Proceedings of the MMAsia 2020: ACM Multimedia Asia, 2020

2019
Simplifying Constructions and Assumptions for i풪.
IACR Cryptol. ePrint Arch., 2019

How to leverage hardness of constant degree expanding polynomials over R to build iO.
IACR Cryptol. ePrint Arch., 2019

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

Statistical ZAP Arguments.
IACR Cryptol. ePrint Arch., 2019

Indistinguishability Obfuscation Without Multilinear Maps: New Paradigms via Low Degree Weak Pseudorandomness and Security Amplification.
IACR Cryptol. ePrint Arch., 2019

How to Leverage Hardness of Constant-Degree Expanding Polynomials over \mathbb R R to build i풪 i O.
Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019

2018
How to leverage hardness of constant-degree expanding polynomials over ℝ to build iO.
IACR Cryptol. ePrint Arch., 2018

Sum-of-Squares Meets Program Obfuscation, Revisited.
IACR Cryptol. ePrint Arch., 2018

Secure MPC: Laziness Leads to GOD.
IACR Cryptol. ePrint Arch., 2018

Indistinguishability Obfuscation Without Multilinear Maps: iO from LWE, Bilinear Maps, and Weak Pseudorandomness.
IACR Cryptol. ePrint Arch., 2018

From FE Combiners to Secure MPC and Back.
IACR Cryptol. ePrint Arch., 2018

2017
Adaptive latent fingerprint segmentation using feature selection and random decision forest classification.
Inf. Fusion, 2017

Threshold Fully Homomorphic Encryption.
IACR Cryptol. ePrint Arch., 2017

Non-Trivial Witness Encryption and Null-iO from Standard Assumptions.
IACR Cryptol. ePrint Arch., 2017

Threshold Cryptosystems From Threshold Fully Homomorphic Encryption.
IACR Cryptol. ePrint Arch., 2017

A note on VRFs from Verifiable Functional Encryption.
IACR Cryptol. ePrint Arch., 2017

Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption.
IACR Cryptol. ePrint Arch., 2017

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

2016
Verifiable Functional Encryption.
IACR Cryptol. ePrint Arch., 2016

Universal Obfuscation and Witness Encryption: Boosting Correctness and Combining Security.
IACR Cryptol. ePrint Arch., 2016

Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption.
Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016

2015
Multi-Input Functional Encryption with Unbounded-Message Security.
IACR Cryptol. ePrint Arch., 2015

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

Functional Encryption: Decentralised and Delegatable.
IACR Cryptol. ePrint Arch., 2015

2014
Exploring Tangible Interactions for Capturing Self Photographs.
Proceedings of the 6th Indian Conference on Human Computer Interaction, 2014

2013
On FHE without bootstrapping.
IACR Cryptol. ePrint Arch., 2013


  Loading...