A SAT-based Public Key Cryptography Scheme

TL;DR

This paper introduces a novel homomorphic public key cryptography scheme based on SAT problems, utilizing SAT formulas as public keys and zero-knowledge proofs for signatures, aiming for secure encryption and verification.

Contribution

It presents a new cryptographic scheme leveraging SAT problems for public key encryption and zero-knowledge signatures, combining homomorphic properties with SAT-based security.

Findings

Scheme is based on SAT formulas satisfied by private keys

Uses probabilistic encryption with XOR of message bits

Incorporates zero-knowledge proofs for signatures

Abstract

A homomorphic public key crypto-scheme based on the Boolean Satisfiability Problem is proposed. The public key is a SAT formula satisfied by the private key. Probabilistic encryption generates functions implied to be false by the public key XOR the message bits. A zero-knowledge proof is used to provide signatures.