Reproduce “Bridges connecting Encryption Schemes” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Mugurel Barcau, Cristian Lupascu, Vicentiu Pasol, George C. Turcas
Researchers formally define "bridges" as secure, unidirectional protocols for ciphertext transformation between distinct encryption schemes. A general construction recipe for Gentry-type bridges is provided, with a security proof establishing their IND-CPA security if the underlying schemes are, and experiments suggest potential performance benefits in hybrid homomorphic encryption contexts.
Key insights
- The IND-CPA security of a bridge can be reduced to the IND-CPA security of the source encryption scheme, provided a specific computational indistinguishability assumption regarding the bridge key distribution holds.
- Gentry-type bridges inherently satisfy this critical technical assumption when the target homomorphic scheme is IND-CPA secure, simplifying their security analysis.
- The use of bridges facilitates interoperability between diverse encryption schemes, offering a structured approach for hybrid cryptographic systems and potentially improving performance for specific homomorphic computations.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.