Valerio Cini

Orcid: 0009-0003-6876-0954

According to our database1, Valerio Cini authored at least 15 papers between 2020 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Papercraft: Lattice-based Verifiable Delay Function Implemented.
IACR Cryptol. ePrint Arch., 2025

Lattice-based Obfuscation from NTRU and Equivocal LWE.
IACR Cryptol. ePrint Arch., 2025

Faster ABE for Turing Machines from Circular Evasive LWE.
Proceedings of the Advances in Cryptology - EUROCRYPT 2025, 2025

2024
(Inner-Product) Functional Encryption with Updatable Ciphertexts.
J. Cryptol., March, 2024

ABE for Circuits with poly(λ)-sized Keys from LWE.
IACR Cryptol. ePrint Arch., 2024

Unbounded ABE for Circuits from LWE, Revisited.
IACR Cryptol. ePrint Arch., 2024

Polynomial Commitments from Lattices: Post-Quantum Security, Fast Verification and Transparent Setup.
IACR Cryptol. ePrint Arch., 2024

Lattice-based Multi-Authority/Client Attribute-based Encryption for Circuits.
IACR Commun. Cryptol., 2024

2023
Lattice-based Succinct Arguments from Vanishing Polynomials.
IACR Cryptol. ePrint Arch., 2023

An Incremental PoSW for General Weight Distributions.
IACR Cryptol. ePrint Arch., 2023

Lattice-Based Succinct Arguments from Vanishing Polynomials - (Extended Abstract).
Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023

2022
Lattice-Based SNARKs: Publicly Verifiable, Preprocessing, and Recursively Composable.
IACR Cryptol. ePrint Arch., 2022

Lattice-Based SNARKs: Publicly Verifiable, Preprocessing, and Recursively Composable - (Extended Abstract).
Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

2021
Updatable Signatures and Message Authentication Codes.
IACR Cryptol. ePrint Arch., 2021

2020
CCA-Secure (Puncturable) KEMs from Encryption With Non-Negligible Decryption Errors.
IACR Cryptol. ePrint Arch., 2020


  Loading...