Panther Protocol Documentation
WebsiteBlogTwitterGovernance ForumVoting
  • 📘Start Here
    • Get Started
    • What is Panther?
    • Who is Panther for?
    • Realized vision and use cases
  • 🔩Panther Core
    • Testnet dApp
    • Mainnet Beta (Canary)
    • Panther Transactions
      • Shielded Pool
      • zAssets
      • zAccount
      • zTrade (OTC Trading)
    • Panther Compliance
      • User Reveals
        • History CSV Export
      • Forensic Reveals
  • 🌌Ecosystem
    • Ecosystem roles
      • Compliance Providers
      • Relayer
      • zMiner
        • Get Started
      • Zone Manager
        • Get Started
    • Fees & Rewards
  • ⚙️Interoperability
    • DeFi Adaptors
      • zSwap
        • Economic optimization of swaps
    • Multi-chain
  • 📚LEARN
    • Glossary
    • UTXOs
      • UTXO Model
      • UTXO Cryptography
      • Merkle Trees
    • ⚗️Cryptographic Primitives
      • ZK proofs
      • ZK SNARKs
        • Groth16
      • Homomorphic encryption
      • Hash functions
      • Poseidon
      • Other Privacy Enhancing Technologies (PETs) used by Panther
      • Elliptic curves
      • Pairings
    • 🔓Security Audits
    • 🤝Community
    • 📚Resources
  • Panther DAO
    • DAO and Decentralization
      • Governance Framework
    • Road to decentralization
      • Decentralization Tool
  • Changelog
    • Product versions
    • Oshiya
    • Panther Testnet
      • Stage 0
      • Stage 1
      • Stage 2
      • Stage 3
      • Stage 4
      • Stage 5
      • Stage 6
      • Stage 7
      • Stage 8
      • Mainnet Beta (Canary)
Powered by GitBook
On this page
Export as PDF
  1. LEARN
  2. Cryptographic Primitives

Homomorphic encryption

PreviousGroth16NextHash functions

Last updated 1 year ago

Homomorphic encryption is a form of encryption that permits computations on encrypted data without the need to decrypt it. The output, when decrypted, is identical to that produced had the operations been performed on the unencrypted data. While there is a lack of practical schemes that deliver fully homomorphic encryption, there do exist practical schemes that exhibit some homomorphic capabilities. One example is RSA. Another is the discrete log-based systems, typically defined either modulo a prime p, or using . It is the latter that is the focus here.

There are two main types of homomorphic encryption: fully homomorphic encryption (FHE) and partially homomorphic encryption (PHE). FHE allows arbitrary computations to be performed on encrypted data, while PHE allows only certain types of computations to be performed, such as addition or multiplication using elliptic curves, with G being a generator of an elliptic curve group. The (homomorphic) operations that can be performed are:

  • Addition: given points bG and cG, an expression of form a = b + c can be evaluated in encrypted form as aG = bG + cG.

  • Scalar multiplication: given bG, an expression of the form, a = cb, where c is a constant, can be evaluated in encrypted form as aG = c(bG).

📚
⚗️
elliptic curves