Cryptocurrencies, which have gained significant adoption in recent years, face ongoing challenges in scalability and privacy. Payment Channel Hubs (PCHs) constitute a solution to both issues by shifting transactions off the public ledger. Various PCH constructions have been proposed, offering different degrees of unlinkability, efficiency, and interoperability. However, regulatory compliance remains a significant concern, particularly under emerging frameworks like the EU’s Markets in Crypto-Assets (MiCA) regulation and FATF Travel Rule requirements. This work addresses a gap in existing PCH constructions: the lack of regulatory-compliant auditability mechanisms. While concurrent work AuditPCH attempts to address this challenge, it suffers from fundamental limitations, including reliance on channel closures for auditing, vulnerability to unilateral de-anonymization by the hub, and lack of formal security guarantees for the auditing process. Our approach fundamentally differs by providing targeted, non-disruptive auditability that allows auditability for high-risk payments while preserving unlinkability for the rest. To achieve this, we present Verifiable Linkable Randomizable Puzzles ( \(\texttt{VLRP} \) ), a new cryptographic protocol that enables a party to commit to a secret using two distinct keys: a verifiability key (VK) and an auditability key (AK). This protocol provides (i) verifiability that the owner of the VK issued the commitment, (ii) the ability to randomize the commitment to ensure unlinkability, even for the owner of the VK, while still allowing traceability using the AK, and (iii) collaborative auditing that prevents unilateral de-anonymization. We then present Auditable Unlinkable Payment Channel Hubs, AUPCH, a PCH built on \(\texttt{VLRP} \) that offers auditability guarantees with stronger security guarantees than existing approaches. AUPCH provides modular integration with existing PCH frameworks (A \(^2\) L, BlindHub), operates without requiring channel closures, and ensures that auditing requires collaboration between hub and auditing agent, preventing abuse by either party alone. Crucially, our approach acts as a wrapper around existing PCH implementations, requiring only replacing randomizable puzzle calls with VLRP calls, a minimal change that dramatically reduces deployment complexity compared to building new systems from scratch.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

AUPCH: Auditable Unlinkable Payment Channel Hubs

  • Pedro Moreno-Sanchez,
  • Mohsen Minaei,
  • Srinivasan Raghuraman,
  • Panagiotis Chatzigiannis,
  • Duc V. Le

摘要

Cryptocurrencies, which have gained significant adoption in recent years, face ongoing challenges in scalability and privacy. Payment Channel Hubs (PCHs) constitute a solution to both issues by shifting transactions off the public ledger. Various PCH constructions have been proposed, offering different degrees of unlinkability, efficiency, and interoperability. However, regulatory compliance remains a significant concern, particularly under emerging frameworks like the EU’s Markets in Crypto-Assets (MiCA) regulation and FATF Travel Rule requirements. This work addresses a gap in existing PCH constructions: the lack of regulatory-compliant auditability mechanisms. While concurrent work AuditPCH attempts to address this challenge, it suffers from fundamental limitations, including reliance on channel closures for auditing, vulnerability to unilateral de-anonymization by the hub, and lack of formal security guarantees for the auditing process. Our approach fundamentally differs by providing targeted, non-disruptive auditability that allows auditability for high-risk payments while preserving unlinkability for the rest. To achieve this, we present Verifiable Linkable Randomizable Puzzles ( \(\texttt{VLRP} \) ), a new cryptographic protocol that enables a party to commit to a secret using two distinct keys: a verifiability key (VK) and an auditability key (AK). This protocol provides (i) verifiability that the owner of the VK issued the commitment, (ii) the ability to randomize the commitment to ensure unlinkability, even for the owner of the VK, while still allowing traceability using the AK, and (iii) collaborative auditing that prevents unilateral de-anonymization. We then present Auditable Unlinkable Payment Channel Hubs, AUPCH, a PCH built on \(\texttt{VLRP} \) that offers auditability guarantees with stronger security guarantees than existing approaches. AUPCH provides modular integration with existing PCH frameworks (A \(^2\) L, BlindHub), operates without requiring channel closures, and ensures that auditing requires collaboration between hub and auditing agent, preventing abuse by either party alone. Crucially, our approach acts as a wrapper around existing PCH implementations, requiring only replacing randomizable puzzle calls with VLRP calls, a minimal change that dramatically reduces deployment complexity compared to building new systems from scratch.