PiTPM: Partially Interactive Signatures for Multi-Device TPM Operations

• URL: http://arxiv.org/abs/2602.09707v1
• Date: Tue, 10 Feb 2026 12:09:05 GMT
• Title: PiTPM: Partially Interactive Signatures for Multi-Device TPM Operations
• Authors: Yunusa Simpa Abdulsalam, Mustapha Hedabou,
• Abstract summary: This paper presents PiTPM, an Aggregator Framework built upon Schnorr's digital signature.<n>Our protocol eliminates the interactive requirement using a hybrid trust architecture.<n>Results show a possible paradigm shift in TPM-based cryptographic system design.
• Score: 0.4125187280299247
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Trusted Platform Module (TPM) 2.0 devices provide efficient hardware-based cryptographic security through tamper-resistant key storage and computation, making them ideal building blocks for multi-party signature schemes in distributed systems. However, existing TPM-based multi-signature constructions suffer from a fundamental limitation, they require interactive protocols where all participants must coordinate during the commitment phase, before any signature can be computed. This interactive requirement creates several critical problems, such as synchronization bottlenecks, quadratic communication complexity, and aborted protocols as a result of participant failure. These limitations become particularly heightened for applications that require cross-device cryptographic operations. This paper presents PiTPM, an Aggregator Framework built upon Schnorr's digital signature. Our protocol eliminates the interactive requirement using a hybrid trust architecture. The proposed framework uses pre-shared randomness seeds stored securely in an Aggregator, enabling deterministic computation of global commitments without inter-participant communication. The resulting signatures of the proposed framework are of constant size regardless of signer count. Our experimental results show a possible paradigm shift in TPM-based cryptographic system design, demonstrating that hybrid trust architectures can achieve significant performance improvements while maintaining rigorous security guarantees. We provide a comprehensive formal security analysis proving EU-CMA security under the discrete logarithm assumption in the random oracle model.

Related papers

• Information-Theoretic Decentralized Secure Aggregation with Collusion Resilience [95.33295072401832]
  We study the problem of decentralized secure aggregation (DSA) from an information-theoretic perspective.<n>We characterize the optimal rate region, which specifies the minimum achievable communication and secret key rates for DSA.<n>Our results establish the fundamental performance limits of DSA, providing insights for the design of provably secure and communication-efficient protocols.
  arXiv  Detail & Related papers  (2025-08-01T12:51:37Z)
• A Compact Post-quantum Strong Designated Verifier Signature Scheme from Isogenies [0.0]
  We present a novel isogeny-based Strong Designated Verifier Signature scheme.<n>It offers a compact, quantum-resistant alternative to existing SDVS constructions.<n>It achieves strong security guarantees, Strong Unforgeability under Chosen-Message Attacks (SUF-CMA), Non-Transferability (NT), and Privacy of Signer's Identity (PSI)
  arXiv  Detail & Related papers  (2025-07-20T10:15:38Z)
• Practical Secure Aggregation by Combining Cryptography and Trusted Execution Environments [1.3068730884406587]
  Secure aggregation enables a group of mutually distrustful parties, each holding private inputs, to collaboratively compute an aggregate value.<n>A major challenge in adopting secure aggregation approaches for practical applications is the significant computational overhead of the underlying cryptographic protocols.<n> Hardware-based security techniques such as trusted execution environments (TEEs) enable computation at near-native speeds.<n>In this work, we introduce several secure aggregation architectures that integrate both cryptographic and TEE-based techniques.
  arXiv  Detail & Related papers  (2025-04-11T07:49:09Z)
• Setup Once, Secure Always: A Single-Setup Secure Federated Learning Aggregation Protocol with Forward and Backward Secrecy for Dynamic Users [12.804623314091508]
  Federated Learning (FL) enables multiple users to collaboratively train a machine learning model without sharing raw data.<n>Secure aggregation protocols mitigate this risk by ensuring that only the aggregated updates are revealed.<n>We present a novel secure aggregation protocol that requires only a single setup for the entire FL training.
  arXiv  Detail & Related papers  (2025-02-13T06:01:09Z)
• CryptoFormalEval: Integrating LLMs and Formal Verification for Automated Cryptographic Protocol Vulnerability Detection [41.94295877935867]
  We introduce a benchmark to assess the ability of Large Language Models to autonomously identify vulnerabilities in new cryptographic protocols. We created a dataset of novel, flawed, communication protocols and designed a method to automatically verify the vulnerabilities found by the AI agents.
  arXiv  Detail & Related papers  (2024-11-20T14:16:55Z)
• Quantum digital signature based on single-qubit without a trusted third-party [45.41082277680607]
  We propose a novel quantum digital signature protocol without a trusted third-party.<n>We prove that the protocol has information-theoretical unforgeability.
  arXiv  Detail & Related papers  (2024-10-17T09:49:29Z)
• Coding-Based Hybrid Post-Quantum Cryptosystem for Non-Uniform Information [53.85237314348328]
  We introduce for non-uniform messages a novel hybrid universal network coding cryptosystem (NU-HUNCC) We show that NU-HUNCC is information-theoretic individually secured against an eavesdropper with access to any subset of the links.
  arXiv  Detail & Related papers  (2024-02-13T12:12:39Z)
• HasTEE+ : Confidential Cloud Computing and Analytics with Haskell [50.994023665559496]
  Confidential computing enables the protection of confidential code and data in a co-tenanted cloud deployment using specialized hardware isolation units called Trusted Execution Environments (TEEs) TEEs offer low-level C/C++-based toolchains that are susceptible to inherent memory safety vulnerabilities and lack language constructs to monitor explicit and implicit information-flow leaks. We address the above with HasTEE+, a domain-specific language (cla) embedded in Haskell that enables programming TEEs in a high-level language with strong type-safety.
  arXiv  Detail & Related papers  (2024-01-17T00:56:23Z)
• Secure Synthesis of Distributed Cryptographic Applications (Technical Report) [1.9707603524984119]
  We advocate using secure program partitioning to synthesize cryptographic applications. This approach is promising, but formal results for the security of such compilers are limited in scope. We develop a compiler security proof that handles subtleties essential for robust, efficient applications.
  arXiv  Detail & Related papers  (2024-01-06T02:57:44Z)
• ScionFL: Efficient and Robust Secure Quantized Aggregation [36.668162197302365]
  We introduce ScionFL, the first secure aggregation framework for federated learning. It operates efficiently on quantized inputs and simultaneously provides robustness against malicious clients. We show that with no overhead for clients and moderate overhead for the server, we obtain comparable accuracy for standard FL benchmarks.
  arXiv  Detail & Related papers  (2022-10-13T21:46:55Z)
• Towards Semantic Communication Protocols: A Probabilistic Logic Perspective [69.68769942563812]
  We propose a semantic protocol model (SPM) constructed by transforming an NPM into an interpretable symbolic graph written in the probabilistic logic programming language (ProbLog) By leveraging its interpretability and memory-efficiency, we demonstrate several applications such as SPM reconfiguration for collision-avoidance.
  arXiv  Detail & Related papers  (2022-07-08T14:19:36Z)
• Practical quantum multiparty signatures using quantum-key-distribution networks [0.0]
  We develop an unconditionally secure signature scheme that guarantees authenticity and transferability of arbitrary length messages in a quantum key distribution network. We provide a comprehensive security analysis of the developed scheme, perform an optimization of the scheme parameters with respect to the secret key consumption, and demonstrate that the developed scheme is compatible with the capabilities of currently available QKD devices.
  arXiv  Detail & Related papers  (2021-07-27T17:41:40Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.