Linearly Homomorphic Encryption from $$\mathsf {DDH}$$

DOI10.1007/978-3-319-16715-2_26zbMath1382.94080OpenAlexW301822183MaRDI QIDQ2790061

Fabien Laguillaumie, Guilhem Castagnos

Publication date: 2 March 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-16715-2_26

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (26)

A tighter proof for CCA secure inner product functional encryption: genericity meets efficiency ⋮ Round-Efficient Anonymous Password-Authenticated Key Exchange Protocol in the Standard Model ⋮ New Ideas to Build Noise-Free Homomorphic Cryptosystems ⋮ Tweakable block ciphers secure beyond the birthday bound in the ideal cipher model ⋮ One-more unforgeability of blind ECDSA ⋮ Secure multiparty computation with free branching ⋮ Promise $$\varSigma $$-Protocol: How to Construct Efficient Threshold ECDSA from Encryptions Based on Class Groups ⋮ Zero-knowledge arguments for subverted RSA groups ⋮ Multi-signatures for ECDSA and its applications in blockchain ⋮ On Constructing Pairing-Free Identity-Based Encryptions ⋮ I want to ride my \texttt{BICYCL} : \texttt{BICYCL} implements cryptography in class groups ⋮ Threshold linearly homomorphic encryption on \(\mathrm{Z}/2^k\mathrm{Z}\) ⋮ MyOPE: malicious security for oblivious polynomial evaluation ⋮ Towards practical topology-hiding computation ⋮ Homomorphic secret sharing for multipartite and general adversary structures supporting parallel evaluation of low-degree polynomials ⋮ An algebraic framework for silent preprocessing with trustless setup and active security ⋮ The special case of cyclotomic fields in quantum algorithms for unit groups ⋮ Secure multiparty computation from threshold encryption based on class groups ⋮ Practical fully secure unrestricted inner product functional encryption modulo \(p\) ⋮ Homomorphic secret sharing for low degree polynomials ⋮ An applications of signed quadratic residues in public key cryptography ⋮ Linearly Homomorphic Encryption from $$\mathsf {DDH}$$ ⋮ Bandwidth-efficient threshold EC-DSA ⋮ Compact zero-knowledge proofs for threshold ECDSA with trustless setup ⋮ A geometric approach to homomorphic secret sharing ⋮ Bandwidth-efficient threshold EC-DSA revisited: online/offline extensions, identifiable aborts proactive and adaptive security

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Discrete logarithm based additively homomorphic encryption and secure data aggregation
• Binary quadratic forms. An algorithmic approach
• Probabilistic encryption
• A key-exchange system based on imaginary quadratic fields
• Computing discrete logarithms in quadratic orders
• Elliptic curve Paillier schemes
• A new public-key cryptosystem over a quadratic order with quadratic decryption time.
• Linearly Homomorphic Encryption from $$\mathsf {DDH}$$
• Receipt-free secret-ballot elections (extended abstract)
• Homomorphic Encryption for Multiplications and Pairing Evaluation
• An Adaptation of the NICE Cryptosystem to Real Quadratic Orders
• Towards a DL-Based Additively Homomorphic Encryption Scheme
• On the Security of Cryptosystems with Quadratic Decryption: The Nicest Cryptanalysis
• Factoring pq 2 with Quadratic Forms: Nice Cryptanalyses
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
• Public-Key Cryptosystems Based on Class Semigroups of Imaginary Quadratic Non-maximal Orders
• Efficient Cryptosystems from 2 k -th Power Residue Symbols
• Advanced Topics in Computional Number Theory
• Fully homomorphic encryption using ideal lattices
• Information Security and Privacy
• Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$
• On Real Quadratic Number Fields Suitable for Cryptography
• Theory of Cryptography
• Public Key Cryptography - PKC 2006
• Advances in Cryptology - ASIACRYPT 2003

This page was built for publication: Linearly Homomorphic Encryption from $$\mathsf {DDH}$$