Homomorphic Signature Scheme for Encrypted Message Verification

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current digital signature schemes lack efficiency and security, particularly in verifying signatures on encrypted or committed messages, and require two-party protocols for issuing signatures, which is not scalable or efficient.

Innovation Solution

A system utilizing homomorphic encoding and decoding functions within a public key infrastructure, allowing for secure and efficient signature generation, verification, and transmission over a computer communication network, using methods such as identity functions, ElGamal encryption, and double ElGamal encryption, enabling signature schemes to operate on encrypted messages without revealing the signature.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If traditional digital signature schemes are used, then security is provided, but efficiency and scalability are poor due to requiring two-party protocols for issuing signatures on encrypted messages

Engineering Contradiction:
Improvesignature issuance efficiencyVSAvoidprotocol complexity
Core Design Contradiction:
ProductivityVSDevice complexity

Solution Approach 1:

The system enables self-service signature issuance where a single party can independently generate signatures on encrypted messages without requiring interaction with another party. The homomorphic encoding function allows the signer to directly sign the encoded message, eliminating the need for two-party protocols while maintaining security.

Inventive Principle:
Principle #25Self-service

Solution Approach 2:

The invention changes the parameter of message representation by introducing homomorphic encoding functions that transform messages into a form that can be directly signed. This parameter change enables efficient single-party signature issuance while preserving the ability to verify signatures without revealing the underlying message.

Inventive Principle:
Principle #35Parameter changes

2Reliability

If signatures are issued on hidden or encrypted messages, then privacy is protected, but verification efficiency decreases

Engineering Contradiction:
Improveprivacy protectionVSAvoidverification time
Core Design Contradiction:
ReliabilityVSLoss of time

Solution Approach 1:

The homomorphic encoding function serves as an intermediary that transforms the message into a form suitable for signing while preserving verifiability. The encoding function allows the verifier to check signature validity without needing to decode or reveal the underlying message, thus maintaining privacy while enabling efficient verification.

Inventive Principle:
Principle #24Intermediary (Mediator)

3Adaptability or versatility

If conventional signature schemes are used, then basic authentication is provided, but scalability to higher-level cryptographic schemes is limited

Engineering Contradiction:
Improvecryptographic scheme versatilityVSAvoidsecurity proof
Core Design Contradiction:
Adaptability or versatilityVSReliability

Solution Approach 1:

The signature scheme based on homomorphic encoding functions is designed to be universal and can serve as a building block for multiple higher-level cryptographic schemes including anonymous credentials, electronic voting, and group signatures. The same core mechanism supports various applications while maintaining provable security properties.

Inventive Principle:
Principle #6Universality (Multi-functionality)

Data Source

PatentUS10397003B2Signature scheme for homomorphic message encoding functions
Publication Date: 2019.08.27 INTERNATIONAL BUSINESS MACHINE CORPORATION
  • US10397003B2 patent drawing
  • US10397003B2 patent drawing
  • US10397003B2 patent drawing

AI summary

A method for cryptographic signing. The disclosure provides for a signature scheme to secure digital communication using homomorphic message encoding functions. The signature may be applied to hidden messages, and the knowledge of a signature can be proved without the value of the signature being revealed. Applications of the present invention may include anonymous credentials, electronic voting, and group signatures.