Homomorphic public-key cryptosystems over groups and rings

We propose a new homomorphic public-key cryptosystem over arbitrary nonidentity finite group based on the difficulty of the membershipproblem for groups of integer matrices. Besides, a homomorphic cryptosystem is designed for the first time over finite commutative rings.

• Publication year

  2003

• Venue

  arXiv.org

• Publication date

  2003-09-08

• Fields of study

  Mathematics, Computer Science

• Identifiers
  arXiv cs/0309010
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Combinatorial Group Theory

  2002cited by this paper
• Lecture Notes on Cryptography

  2001cited by this paper
• Improved Public Key Cryptosystem using Finite non Abelian Groups

  2001cited by this paper
• Open questions

  2001cited by this paper
• Loopholes in Two Public Key Cryptosystems Using the Modular Group

  2001cited by this paper
• Cryptanalysis of Two Cryptosystems Based on Group Actions

  1999cited by this paper
• Non-Interactive CryptoComputing For NC1

  1999cited by this paper
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes

  1999cited by this paper
• Dense Probabilistic Encryption

  1999cited by this paper
• A Functional Cryptosystem Using a Group Action

  1999cited by this paper
• Non-interactive cryptocomputing for NC/sup 1/

  1999cited by this paper
• Protecting Mobile Agents Against Malicious Hosts

  1998cited by this paper
• A new public key cryptosystem based on higher residues

  1998cited by this paper
• Lower Bounds on Generic Algorithms in Groups

  1998cited by this paper
• Public-Key Cryptosystems Using the Modular Group

  1998cited by this paper
• Algebraic aspects of cryptography

  1998cited by this paper
• A New Public-Key Cryptosystem as Secure as Factoring

  1998cited by this paper
• "A new public-key cryptosystem as secure as factoring," Advances in Cryptology-Proceedings of EUROCRYPTO '98

  1998cited by this paper
• An implementable scheme for secure delegation of computing and data

  1997cited by this paper
• Permutation Groups and Polynomial-Time Computation

  1996cited by this paper
• A new privacy homomorphism and applications

  1996cited by this paper
• A New Privacy Homomorphism and Applications

  1996cited by this paper
• Average-case completeness of a word problem for groups

  1995cited by this paper
• The Complexity of Grigorchuk Groups with Application to Cryptography

  1991influential reference
• Open Questions, Talk Abstracts, and Summary of Discussions

  1989cited by this paper
• Non-Uniform Automata Over Groups

  1987cited by this paper
• On privacy homomorphisms

  1987cited by this paper
• A Public Key Cryptosystem Based on the Word Problem

  1985influential reference
• Probabilistic Encryption

  1984cited by this paper
• ON DATA BANKS AND PRIVACY HOMOMORPHISMS

  1978cited by this paper
• Finite Rings With Identity

  1974influential reference
• A Course in Arithmetic

  1973cited by this paper

• Solvability and Nilpotency of Lie Algebras in Cryptography and Steganography

  2025cites this paper
• A Survey on Ring Theory for its Mathematical Foundation and Applications

  2024cites this paper
• On Compression Functions over Groups with Applications to Homomorphic Encryption

  2022cites this paper
• A New Encryption Scheme Based on Groupring

  2021cites this paper
• A note on fully homomorphic encryption of real-life data

  2021cites this paper
• New Efficient QERPKC based on Partial Discrete Logarithm Problem

  2020cites this paper
• Medical Diagnostics Based on Encrypted Medical Data

  2019cites this paper
• Chapter 1 Homomorphic Encryption — Theory and Application

  2019cites this paper
• The Hidden Subgroup Problem and Post-quantum Group-based Cryptography

  2018cites this paper
• Efficient Fully Homomorphic Encryption with Large Plaintext Space

  2018cites this paper
• Mathematical Software – ICMS 2018

  2018cites this paper
• Bounded Fully Homomorphic Encryption from Monoid Algebras

  2018cites this paper
• Practical private-key fully homomorphic encryption in rings

  2018cites this paper
• An Arithmetic Technique for Non-Abelian Group Cryptosystem

  2017cites this paper
• Rewriting Methods in Groups with Applications to Cryptography

  2017cites this paper
• Novel Noncommutative Cryptography Scheme Using Extra Special Group

  2017cites this paper
• An IND-CCA2 Secure Public Key Cryptographic Protocol using Suzuki 2-Group

  2017cites this paper
• AN IND-CPA SECURE PKC TECHNIQUE BASED ON DIHEDRAL GROUP

  2017cites this paper
• Cryptography with right-angled Artin groups

  2016cites this paper
• Homomorphic Encryption Based on Group Algebras and Goldwasser-Micali Scheme

  2016cites this paper
• Scalable and Robust Hierarchical Group of Data in Wireless Sensor Networks

  2014cites this paper
• Homomorphic Encryption: Theory & Applications

  2013influential citation
• Homomorphic Encryption — Theory and Application

  2013cites this paper
• Decision and Search in Non-Abelian Cramer-Shoup Public Key Cryptosystem

  2013cites this paper
• A taxonomy of secure data aggregation in wireless sensor networks

  2012cites this paper
• Secure data aggregation in wireless sensor networks

  2011cites this paper
• Non-Commutative Cryptography and Complexity of Group-Theoretic Problems

  2011cites this paper
• Aspects of Nonabelian Group Based Cryptography: A Survey and Open Problems

  2011cites this paper
• Secure data aggregation in wireless sensor networks

  2010cites this paper
• Algebraic cryptography: New constructions and their security against provable break

  2009cites this paper
• Discrete logarithms for finite groups

  2009cites this paper
• A NEW REPRESENTATION ALGORITHM IN A FREE GROUP

  2009cites this paper
• Secure Data Aggregation in Wireless Sensor Network: a survey

  2008cites this paper
• Communication Complexity in Algebraic Two-Party Protocols

  2008cites this paper
• The Theory and Applications of Homomorphic Cryptography

  2008cites this paper
• Linear representations of braid groups and braid-based cryptography

  2007cites this paper
• New Public Key Cryptosystems Using Polynomials over Non-commutative Rings

  2007cites this paper
• Cryptanalysis of a homomorphic public-key cryptosystem over a finite group

  2007influential citation
• Encryption methods using formal power series rings

  2006cites this paper
• Cryptosystems using Linear Groups

  2006influential citation
• USING THE SUBGROUP MEMBERSHIP SEARCH PROBLEM IN PUBLIC KEY CRYPTOGRAPHY

  2005cites this paper
• Constructions in public-key cryptography over matrix groups

  2005cites this paper
• Efficient, Non-optimistic Secure Circuit Evaluation Based on the ElGamal Encryption

  2005cites this paper
• Homomorphic Public-Key Cryptosystems and Encrypting Boolean Circuits

  2003cites this paper