Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleDecember 2023
(Inner-Product) Functional Encryption with Updatable Ciphertexts
AbstractWe propose a novel variant of functional encryption which supports ciphertext updates, dubbed ciphertext-updatable functional encryption. Such a feature further broadens the practical applicability of the functional encryption paradigm and allows ...
- ArticleAugust 2023
Lattice-Based Succinct Arguments from Vanishing Polynomials: (Extended Abstract)
AbstractSuccinct arguments allow a prover to convince a verifier of the validity of any statement in a language, with minimal communication and verifier’s work. Among other approaches, lattice-based protocols offer solid theoretical foundations, post-...
- ArticleApril 2023
- ArticleAugust 2022
Lattice-Based SNARKs: Publicly Verifiable, Preprocessing, and Recursively Composable: (Extended Abstract)
AbstractA succinct non-interactive argument of knowledge (SNARK) allows a prover to produce a short proof that certifies the veracity of a certain NP-statement. In the last decade, a large body of work has studied candidate constructions that are secure ...
- ArticleMay 2021
Updatable Signatures and Message Authentication Codes
AbstractCryptographic objects with updating capabilities have been proposed by Bellare, Goldreich and Goldwasser (CRYPTO’94) under the umbrella of incremental cryptography. They have recently seen increased interest, motivated by theoretical questions (...
- ArticleDecember 2020
CCA-Secure (Puncturable) KEMs from Encryption with Non-Negligible Decryption Errors
AbstractPublic-key encryption (PKE) schemes or key-encapsulation mechanisms (KEMs) are fundamental cryptographic building blocks to realize secure communication protocols. There are several known transformations that generically turn weakly secure schemes ...