Decentralized Evaluation of Quadratic Polynomials on Encrypted Data

DOI10.1007/978-3-030-30215-3_5MaRDI QIDQ6488965FDOQ6488965

Authors: Chloé Hébant, Duong Hieu Phan, David Pointcheval 

Publication date: 14 March 2024

Recommendations

• Fully homomorphic encryption using ideal lattices
• Theory of Cryptography
• Verifiable Decryption for Fully Homomorphic Encryption
• On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
• Multikey fully homomorphic encryption and applications

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Symbolic computation and algebraic computation (68W30) Cryptography (94A60)

Cites Work

• Fully homomorphic encryption using ideal lattices
• Theory of Cryptography
• Functional encryption: definitions and challenges
• How to share a secret
• Title not available (Why is that?)
• Fuzzy Identity-Based Encryption
• Title not available (Why is that?)
• Converting pairing-based cryptosystems from composite-order groups to prime-order groups
• Title not available (Why is that?)
• Decentralizing attribute-based encryption
• Multi-input functional encryption
• Reusable garbled circuits and succinct functional encryption
• Fast distributed RSA key generation for semi-honest and malicious adversaries
• Practical functional encryption for quadratic functions with applications to predicate encryption
• Decentralized multi-client functional encryption for inner product
• Decentralized dynamic broadcast encryption

This page was built for publication: Decentralized Evaluation of Quadratic Polynomials on Encrypted Data

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