R-Part Knowledge Proof for Blockchain Transaction Security
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional hash puzzles in blockchain transactions are vulnerable to miner attacks, as they reveal the secret value and are tied to specific identities, limiting flexibility in redeeming transactions without pre-specifying recipients.
Innovation Solution
The introduction of an 'r-puzzle' based on the r-part of an ECDSA signature, allowing any party to prove knowledge of a secret value without revealing it, using a threshold signature scheme that enables multiple participants to collaborate without revealing their ephemeral keyshares.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If conventional hash puzzles are used in blockchain transactions, then knowledge proof can be implemented, but the secret value is revealed and transactions are vulnerable to miner attacks
Solution Approach 1:
The patent extracts only the r-part from the complete ECDSA signature, using it as the knowledge proof instead of the traditional hash puzzle. This extraction allows verification of secret knowledge without revealing the full secret value, preventing miner attacks while maintaining security.
Solution Approach 2:
The patent changes the verification parameter from a hash puzzle solution (which reveals the secret) to an r-part of ECDSA signature (which proves knowledge without full revelation). This parameter change fundamentally alters how knowledge proof is implemented, enhancing security against miner attacks.
2Adaptability or versatility
If conventional hash puzzles with P2PKH are used, then recipient identity is specified, but flexibility in redeeming transactions is limited
Solution Approach 1:
The r-puzzle mechanism provides universal verification that can be applied to any transaction type without requiring pre-specified recipient identities. Any party with the secret can redeem the transaction, making the system more versatile and adaptable to different use cases.
Solution Approach 2:
Instead of specifying the recipient in advance and requiring their signature, the patent inverts the approach by requiring proof of secret knowledge (r-part) that can be provided by any authorized party. This inversion removes the constraint of pre-specified recipients while maintaining security.
3Reliability
If the complete ECDSA signature is used for knowledge proof, then verification is possible, but the ephemeral key is revealed compromising future security
Solution Approach 1:
The patent extracts only the r-part from the complete ECDSA signature (which consists of r and s components). This extraction provides sufficient verification capability while preventing exposure of the ephemeral key and other sensitive information contained in the full signature.
Solution Approach 2:
The patent uses a copy (the r-part) of the ECDSA signature that contains verification information without the complete secret data. This partial copy enables knowledge proof while preserving the security of the full signature and ephemeral key.
Data Source
AI summary
At least one proof transaction for recording on a blockchain comprises at least an s-part for an Elliptic Curve Digital Signature Algorithm, ECDSA, signature. The s-part is computed from a set of signature components, each provided by a participant of a signing subset of a set of keyshare participants. Each of keyshare participant holds an ephemeral keyshare of an unknown ephemeral key, and each of the signing components is provided by the participant of the signing subset based on their ephemeral keyshare. The at least one proof transaction indicates an r-challenge of at least one challenge transaction, and a node of a blockchain network applies signature verification to: (i) the s-part of the at least one proof transaction, and (ii) one of: (iia) an r-part of the r-challenge, (iib) an r-part of the at least one proof transaction, and in that event checks that that r-part satisfies the r-challenge.