Aggregate Signature Attestation for Local and Global VNF Verification
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing attestation methods in virtualized computing platforms face challenges in efficiently verifying the validity of multiple targets, including long verification times and inability to identify invalid targets, while ensuring confidentiality and resource distribution in multi-owner environments.
Innovation Solution
A method for generating synchronized aggregate signatures using a zero-knowledge proof cryptographic protocol, allowing for local and global verification of attestations with constant time batch verification, utilizing a cyclic group structure and bilinear couplings to ensure security and confidentiality.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If aggregate attestation is used to verify multiple targets, then verification efficiency is improved, but verification time becomes linear to the number of targets
Solution Approach 1:
The patent segments the verification process into local verification (for individual targets) and global verification (for the entire group). This allows verifiers to choose the appropriate verification scope based on their needs, breaking the linear time complexity constraint of traditional aggregate verification while maintaining the efficiency benefits of batch verification when full group verification is required.
Solution Approach 2:
The patent introduces a new dimension of verification scope control by enabling both local and global verification modes. This dimensional change allows the system to operate at different levels of granularity, transforming the single-dimension linear verification time into a multi-dimensional verification framework where time complexity can be adjusted based on the verification scope.
2Productivity
If Boolean attestation reports are used to indicate validity, then computational resources are distributed and parallelized, but invalid targets cannot be identified
Solution Approach 1:
The patent segments the attestation information into two layers: aggregate attestation information for global verification and individual target attestation information for local verification. This segmentation allows verifiers to obtain both the overall validity status and the ability to identify specific invalid targets when needed, resolving the information loss problem while maintaining parallelized computation.
Solution Approach 2:
The patent applies local quality by providing different verification capabilities at different levels: global verifiers receive aggregate information for efficient batch verification, while local verifiers can access individual target information for detailed validation. This ensures that each verifier receives the appropriate level of detail for their specific needs without unnecessary overhead.
3Reliability
If parent nodes verify child node attestations, then group attestation is achieved, but confidentiality of target configurations is compromised
Solution Approach 1:
The patent introduces cryptographic proof mechanisms as intermediaries between targets and verifiers. Instead of parent nodes directly accessing and verifying target configurations, targets provide cryptographic proofs that attest to their validity without revealing their actual configurations. This intermediary layer maintains group attestation reliability while preserving configuration confidentiality through zero-knowledge proof properties.
4Ease of operation
If local verification of aggregate signatures is enabled, then verification of specific targets is possible, but computational cost increases significantly
Solution Approach 1:
The patent makes the verification process dynamic by allowing verifiers to choose between local and global verification modes based on their specific needs. The system adapts the verification scope and computational effort accordingly, rather than forcing all verifiers to perform expensive local verification. This dynamic approach reduces overall computational cost while maintaining the capability for specific target verification when required.
Data Source
AI summary
A method for signing a message mi, by a user device, from a zero-knowledge proof cryptographic protocol defined by an element g belonging to a group G1 of order p, with p designating a prime integer, and elements u, v, r, s, t belonging to a group G2, a hash function H and a current time period w. The method includes: a generating a pair of private and public keys, the private key including an element αi selected from the ring Z/pZ, the public key including a first element and a second element being a zero-knowledge proof of possession generated from the cryptographic protocol; and generating a signature σi of the message mi from the private key and a random variable 6, the signature including a first element σ1i and a second element σ2i.