Composing bridges

DOI10.1016/J.IC.2025.105285MaRDI QIDQ6982311zbMATH OpenFDO

Authors Mugurel Barcau, Vicenţiu Paşol, George C. Ţurcaş

Publication date 19 May 2025

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.IC.2025.105285

zbMATH Keywords

bridgecomposabilityfully composable homomorphic encryptionIND-CPA security

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• (Leveled) fully homomorphic encryption without bootstrapping
• A note on computational indistinguishability
• Computing arbitrary functions of encrypted data
• Efficient FHEW bootstrapping with small evaluation keys, and applications to threshold homomorphic encryption
• Efficient fully homomorphic encryption from (standard) LWE
• FHEW: bootstrapping homomorphic encryption in less than a second
• scientific article; zbMATH DE number 2086716 (Why is no real title available?)
• Improved proxy re-encryption schemes with applications to secure distributed storage
• Rasta: a cipher with low ANDdepth and few ANDs per bit
• Universal proxy re-encryption
• Universally composable security
• Universally Composable Security with Global Setup

This page was built for publication: Composing bridges

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6982311)