Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Ad Hoc PSM Protocols: Secure Computation Without Coordination

Amos Beimel, Yuval Ishai, Eyal Kushilevitz

Published Jan 1, 2017• 19 citations
Publisher
DOI
10.1007/978-3-319-56617-7_20

Related papers

The Complexity of Multiparty PSM Protocols and Related Models

Amos Beimel, Eyal Kushilevitz, Pnina Nissim

Lecture notes in computer science•Jan 1, 2018•41 citations

Private simultaneous messages based on quadratic residues

Kazumasa Shinagawa, Reo Eriguchi, Shohei Satake +1 more

Abstract Private Simultaneous Messages (PSM) model is a minimal model for secure multiparty computation. Feige, Kilian, and Naor (STOC 1994) and Ishai (Cryptology and Information Security Series 2013) constructed PSM protocols based on quadratic residues. In this paper, we define QR-PSM protocols as a generalization of these protocols. A QR-PSM protocol is a PSM protocol whose decoding function outputs the quadratic residuosity modulo p of what is computed from messages. We design a QR-PSM protocol for any symmetric function $$f: \{0,1\}^n \rightarrow \{0,1\}$$ f : { 0 , 1 } n → { 0 , 1 } of communication complexity $$O(n^2)$$ O ( n 2 ) . As far as we know, it is the most efficient PSM protocol for symmetric functions since the previously known best PSM protocol was of $$O(n^2\log n)$$ O ( n 2 log n ) (Beimel et al., CRYPTO 2014). We also study the sizes of the underlying finite fields $$\mathbb {F}_p$$ F p in the protocols since the communication complexity of a QR-PSM protocol is proportional to the bit length of the prime p. We show that there is a prime $$p \le (1+o(1))N^22^{2N-2}$$ p ≤ ( 1 + o ( 1 ) ) N 2 2 2 N - 2 such that any length-N pattern of quadratic (non)residues appears modulo p (and hence it can be used for general QR-PSM protocols), which improves the Peralta’s known result (Mathematics of Computation 1992) by a constant factor $$(1+\sqrt{2})^2$$ ( 1 + 2 ) 2 .

arXiv:2209.01859•Designs Codes and Cryptography•Aug 16, 2023•4 citations

Secure Computation: A Primer

Geoffroy Couteau

SpringerBriefs in information security and cryptography•Jan 1, 2026•0 citations

A Privacy Preserving Authentication Protocol Using Quantum Computing for V2I Authentication in Vehicular Ad Hoc Networks

Kumar Prateek, Fahiem Altaf, Ruhul Amin +1 more

Many cryptographic techniques have been proposed to conceive a secure and privacy-oriented vehicular ad hoc network (VANET) for its practical deployment. The security of these techniques requires a common secret key to be shared between the communicating entities or depend upon the premise that some mathematical problems are computationally hard. However, because of the open nature of the wireless medium, the communication cannot be kept confidential and is prone to eavesdropping. Furthermore, with the arrival of quantum computers, these techniques are prone to quantum attacks—the time complexity of the assumed hard problem gets reduced from millions of years to a few seconds. In this paper, we propose a conditional privacy-preserving authentication scheme based on a quantum key distribution protocol for vehicle-to-infrastructure (V2I) communication. Our scheme inherits the properties of the quantum key distribution protocol. It does not require a secret authentication key to be transmitted conventionally and is resistant to quantum attacks. Apart from protecting VANETs against generic security threats, including node impersonation, message tampering, and repudiation, our scheme defends VANETs against man-in-the-middle attacks, replay attacks, etc. Besides, our protocol ensures message unlinkability, vehicle-identity privacy, and vehicle traceability if a vehicle misbehaves. The results obtained from the performance evaluation of our scheme confirm reasonable values of information leakage, key length, bit error probability, etc.

Security and Communication Networks•Mar 4, 2022•36 citations

Drones Don't Trust Blindly: Quantum-Secure AKE Protocol for IoD-Enabled FANETs

Salman Shamshad, Sana Belguith, Alma Oracevic

The convergence of autonomous aerial systems and networking technologies has given rise to the Internet of Drones (IoD) as a compelling paradigm, gaining significant attention from academia and industry stakeholders. Drones often operate in swarm formations to collaboratively achieve autonomous coordination and aerial intelligence, thereby forming a Flying Ad Hoc Network (FANET). However, the persistent vulnerability remains in the insecure communication link, exposing the network to eavesdropping and unauthorized access. Addressing such shortcomings necessitates a robust Authentication and Key Exchange (AKE) protocol. Therefore, we have designed a quantum secure AKE protocol integrating NIST-proven quantum secure primitives, including ML-DSA, symmetric AES, and hash functions. To the best of our knowledge, this is the first AKE protocol that leverages a quantum secure signature scheme for securing IoD-enabled FANET applications. The designed protocol incorporates hardware-specific fingerprinting integrated with a noise tolerance mechanism to eliminate the risk of unauthorized device tampering. The use of re-synchronization and robust security measures for credential management further enhances its resilience against desynchronization and stolen attacks. The findings of performance evaluation exhibit the superiority of the designed protocol over the prevalent AKE protocols, with a remarkable reduction of 67.62% in computation cost while achieving a 50% improvement in overall security. Finally, implementing a complete authentication cycle using PIX32 and Pixhawk 6C drones sets a new benchmark as a practical validation of the designed AKE protocol within a real-world IoD testbed.

IEEE Transactions on Intelligent Transportation Systems•Apr 30, 2026•2 citations

Research and Application of Secure Multi-party Computation Protocols

Ke Chen

•Jan 1, 2003•2 citations
Abstract Private Simultaneous Messages (PSM) model is a minimal model for secure multiparty computation. Feige, Kilian, and Naor (STOC 1994) and Ishai (Cryptology and Information Security Series 2013) constructed PSM protocols based on quadratic residues. In this paper, we define QR-PSM protocols as a generalization of these protocols. A QR-PSM protocol is a PSM protocol whose decoding function outputs the quadratic residuosity modulo p of what is computed from messages. We design a QR-PSM protocol for any symmetric function f:{0,1}n→{0,1}f: \{0,1\}^n \rightarrow \{0,1\}f:{0,1}n→{0,1} f : { 0 , 1 } n → { 0 , 1 } of communication complexity O(n2)O(n^2)O(n2) O ( n 2 ) . As far as we know, it is the most efficient PSM protocol for symmetric functions since the previously known best PSM protocol was of O(n2log⁡n)O(n^2\log n)O(n2logn) O ( n 2 log n ) (Beimel et al., CRYPTO 2014). We also study the sizes of the underlying finite fields Fp\mathbb {F}_pFp​ F p in the protocols since the communication complexity of a QR-PSM protocol is proportional to the bit length of the prime p. We show that there is a prime p≤(1+o(1))N222N−2p \le (1+o(1))N^22^{2N-2}p≤(1+o(1))N222N−2 p ≤ ( 1 + o ( 1 ) ) N 2 2 2 N - 2 such that any length-N pattern of quadratic (non)residues appears modulo p (and hence it can be used for general QR-PSM protocols), which improves the Peralta’s known result (Mathematics of Computation 1992) by a constant factor (1+2)2(1+\sqrt{2})^2(1+2​)2 ( 1 + 2 ) 2 .
Many cryptographic techniques have been proposed to conceive a secure and privacy-oriented vehicular ad hoc network (VANET) for its practical deployment. The security of these techniques requires a common secret key to be shared between the communicating entities or depend upon the premise that some mathematical problems are computationally hard. However, because of the open nature of the wireless medium, the communication cannot be kept confidential and is prone to eavesdropping. Furthermore, with the arrival of quantum computers, these techniques are prone to quantum attacks—the time complexity of the assumed hard problem gets reduced from millions of years to a few seconds. In this paper, we propose a conditional privacy-preserving authentication scheme based on a quantum key distribution protocol for vehicle-to-infrastructure (V2I) communication. Our scheme inherits the properties of the quantum key distribution protocol. It does not require a secret authentication key to be transmitted conventionally and is resistant to quantum attacks. Apart from protecting VANETs against generic security threats, including node impersonation, message tampering, and repudiation, our scheme defends VANETs against man-in-the-middle attacks, replay attacks, etc. Besides, our protocol ensures message unlinkability, vehicle-identity privacy, and vehicle traceability if a vehicle misbehaves. The results obtained from the performance evaluation of our scheme confirm reasonable values of information leakage, key length, bit error probability, etc.
The convergence of autonomous aerial systems and networking technologies has given rise to the Internet of Drones (IoD) as a compelling paradigm, gaining significant attention from academia and industry stakeholders. Drones often operate in swarm formations to collaboratively achieve autonomous coordination and aerial intelligence, thereby forming a Flying Ad Hoc Network (FANET). However, the persistent vulnerability remains in the insecure communication link, exposing the network to eavesdropping and unauthorized access. Addressing such shortcomings necessitates a robust Authentication and Key Exchange (AKE) protocol. Therefore, we have designed a quantum secure AKE protocol integrating NIST-proven quantum secure primitives, including ML-DSA, symmetric AES, and hash functions. To the best of our knowledge, this is the first AKE protocol that leverages a quantum secure signature scheme for securing IoD-enabled FANET applications. The designed protocol incorporates hardware-specific fingerprinting integrated with a noise tolerance mechanism to eliminate the risk of unauthorized device tampering. The use of re-synchronization and robust security measures for credential management further enhances its resilience against desynchronization and stolen attacks. The findings of performance evaluation exhibit the superiority of the designed protocol over the prevalent AKE protocols, with a remarkable reduction of 67.62% in computation cost while achieving a 50% improvement in overall security. Finally, implementing a complete authentication cycle using PIX32 and Pixhawk 6C drones sets a new benchmark as a practical validation of the designed AKE protocol within a real-world IoD testbed.