Feige-Fiat-Shamir Signature Method for Low-Latency Data Stream Verification

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing digital signature verification methods are inefficient for computationally-constrained nodes in networks, particularly in batch-verification processes, which can lead to latency and failure in authenticating live or non-live data streams, such as video signals, especially in scenarios where real-time verification is critical.

Innovation Solution

The implementation of a Feige-Fiat-Shamir-based signature method with efficient aggregated-signature generation, where each data block incorporates the signature of the previous block, allowing for metadata-based authentication that enables fast verification of arbitrary segments of data streams without requiring data from outside the verification segment, thus reducing latency.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If traditional digital signature verification methods are used, then message authenticity can be verified, but verification efficiency is low and latency is high for computationally-constrained nodes

Engineering Contradiction:
Improveverification efficiencyVSAvoidverification latency
Core Design Contradiction:
ProductivityVSLoss of time

Solution Approach 1:

The patent segments the verification process by introducing batch verification that can verify multiple signatures simultaneously. The system divides the verification task into batches where a single verification operation can validate multiple signatures, dramatically improving efficiency for computationally-constrained nodes while reducing verification latency

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent applies preliminary action by pre-computing certain verification components and preparing batch verification structures in advance. The system pre-processes signature batches and prepares verification parameters beforehand, so that when verification is needed, the actual computation time is minimized, thereby reducing latency for real-time applications

Inventive Principle:
Principle #10Preliminary action

2Productivity

If batch verification is performed, then verification efficiency improves, but the ability to pinpoint rogue messages becomes more difficult

Engineering Contradiction:
Improvebatch verification efficiencyVSAvoidrogue message identification
Core Design Contradiction:
ProductivityVSDifficulty of detecting and measuring

Solution Approach 1:

The patent implements feedback mechanisms where the batch verification process provides information about which specific signatures within the batch failed verification. The system uses feedback from the batch verification result to guide subsequent individual verification of suspicious messages, making rogue message identification more efficient while maintaining batch verification benefits

Inventive Principle:
Principle #23Feedback

Solution Approach 2:

The patent extracts and isolates the problematic signature from the batch by using verification feedback to identify which specific signature failed. Once a rogue message is detected in batch verification, the system extracts that specific signature for individual re-verification, separating the detection problem from the batch processing to maintain both efficiency and accuracy

Inventive Principle:
Principle #2Taking out (Extraction)

Data Source

PatentUS10361865B2Signature method and system
Publication Date: 2019.07.23 CISCO TECHNOLOGY INC
  • US10361865B2 patent drawing
  • US10361865B2 patent drawing
  • US10361865B2 patent drawing

AI summary

In one embodiment, a method, system, and apparatus are described, the method, system, and apparatus including generating metadata to be associated with each block of a series of blocks, the generating including, except for an initial block, receiving: a first block, including a signed block, and a second block to be signed, retrieving a first value including a square of a random number, R′2, multiplying R′2 by a nonce, r, and setting r·R′2 to be a square of a first random number, denoted R2, for the second block, retrieving a second value from the first block, the second value including K-bit vector, E′, determining a bit string value of the second block, M, computing E=hash(R2∥M∥E′), and determining a signature, Sig, for the second block by calculating Sig=r Sig′ SE-E′. Related methods, systems, and apparatuses are also described.