CCA-Secure Keyed-Fully Homomorphic Encryption
From MaRDI portal
Publication:2798772
DOI10.1007/978-3-662-49384-7_4zbMath1388.94067OpenAlexW2295171624MaRDI QIDQ2798772
Chang-she Ma, Kouichi Sakurai, Robert H. Deng, Junzuo Lai, Jian Weng
Publication date: 13 April 2016
Published in: Public-Key Cryptography – PKC 2016 (Search for Journal in Brave)
Full work available at URL: https://ink.library.smu.edu.sg/sis_research/3352
fully homomorphic encryptionchosen ciphertext securityconvertible identity-based fully homomorphic encryption
Related Items (4)
Chosen ciphertext secure keyed-homomorphic public-key cryptosystems ⋮ Chosen ciphertext secure keyed two-level homomorphic encryption ⋮ Achievable \textsf{CCA2} relaxation for homomorphic encryption ⋮ Keyed-fully homomorphic encryption without indistinguishability obfuscation
Cites Work
- Unnamed Item
- Reducing concurrent analysis under a context bound to sequential analysis
- Explaining relaxed memory models with program transformations
- Counter-Example Guided Fence Insertion under TSO
- Sound and Complete Monitoring of Sequential Consistency for Relaxed Memory Models
- Faster Fully Homomorphic Encryption
- Verification of Concurrent Programs on Weak Memory Models
- Effective Program Verification for Relaxed Memory Models
- Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes
- Fully Homomorphic Encryption over the Integers
- Reducing Context-Bounded Concurrent Reachability to Sequential Reachability
- How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
- The Benefits of Duality in Verifying Concurrent Programs under TSO
- Robustness against Power is PSpace-complete
- Effective Abstractions for Verification under Relaxed Memory Models
- Stateless Model Checking for TSO and PSO
- How to use indistinguishability obfuscation
- Tools and Algorithms for the Construction and Analysis of Systems
- Software Verification for Weak Memory via Program Transformation
- Checking and Enforcing Robustness against TSO
- Efficient Identity-Based Encryption Without Random Oracles
- Tools and Algorithms for the Construction and Analysis of Systems
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: CCA-Secure Keyed-Fully Homomorphic Encryption
