Alexis Korb

Orcid: 0000-0001-6888-5296

According to our database1, Alexis Korb authored at least 13 papers between 2020 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Building Hard Problems by Combining Easy Ones: Revisited.
IACR Cryptol. ePrint Arch., 2025

(Multi-Input) FE for Randomized Functionalities, Revisited.
IACR Cryptol. ePrint Arch., 2025

Incrementally Verifiable Computation for NP from Standard Assumptions.
Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

Dynamic Bounded-Collusion Streaming Functional Encryption from Minimal Assumptions.
Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

2024
Adaptively Secure Streaming Functional Encryption.
IACR Cryptol. ePrint Arch., 2024

Bounded-Collusion Streaming Functional Encryption from Minimal Assumptions.
IACR Cryptol. ePrint Arch., 2024

2023
Hard Languages in $\mathsf{NP} \cap \mathsf{coNP}$ and NIZK Proofs from Unstructured Hardness.
IACR Cryptol. ePrint Arch., 2023

Hard Languages in $\text{NP}\cap\text{coNP}$ and NIZK Proofs from Unstructured Hardness.
Electron. Colloquium Comput. Complex., 2023

Hard Languages in NP ∩ coNP and NIZK Proofs from Unstructured Hardness.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Streaming Functional Encryption.
Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023

2022
Beyond the Csiszár-Korner Bound: Best-Possible Wiretap Coding via Obfuscation.
Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

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

2020
Amplifying the Security of Functional Encryption, Unconditionally.
Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020


  Loading...