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

Public-Key Cryptographic Primitives Provably as Secure as Subset Sum

Vadim Lyubashevsky, Adriana Palacio, Gil Segev

Published Jan 1, 2010• 93 citations
Publisher
DOI
10.1007/978-3-642-11799-2_23

Related papers

CS-LAKA: A Lightweight Authenticated Key Agreement Protocol With Critical Security Properties for IoT Environments

Yimin Guo, Guo Ya-jun

Anonymity, robust synchronization, and perfect forward secrecy are the most important security properties of authenticated key agreement (AKA) protocols. Designing AKA protocols that simultaneously achieve these security properties and availability in the IoT environment is a challenging task. AKA protocols built using public key cryptographic primitives have advantages in achieving these critical security properties, but performing expensive public-key cryptographic operations is inefficient for resource-constrained IoT devices. The authentication protocols based on symmetric cryptographic primitives are often subject to various attacks. This paper proposes a secure lightweight AKA protocol with critical security properties (called CS-LAKA) for IoT environments without using public-key cryptographic primitives. LAKA cleverly achieves the security goals of anonymity, robust synchronization, and perfect forward secrecy by embedding dynamic identities in authenticators, and a few additional exchange messages are added. This enables LAKA to have both robust security and high efficiency. Subsequently, we perform a formal security analysis to prove that LAKA is secure, and compared with existing related schemes, LAKA has obvious advantages in terms of security, functionality and running performance.

IEEE Transactions on Services Computing•Aug 29, 2023•37 citations

Cryptographic Protocols Provably Secure Against Dynamic Adversaries

Donald Beaver, Stuart Haber

Springer eBooks•Aug 8, 2007•132 citations

Privacy Preserving Protocals and Security Proof Techniques

Lillian Kråkmo

One of the challenges within public-key based cryptosystems is providing the user with a convenient interface, while retaining security. In the framework of universally composable security, we propose an ideal functionality for secure messaging, with a user-friendly interface. We also show how to realize it using a cryptographic primitive and a public key

•Jan 1, 2009•0 citations

Towards Tightly Secure Deterministic Public Key Encryption

Daode Zhang, Bao Li, Yamin Liu +3 more

Lecture notes in computer science•Jan 1, 2018•1 citation

On the Power of Public-Key Encryption in Secure Computation

Mohammad Mahmoody, Hemanta K. Maji, Manoj Prabhakaran

Lecture notes in computer science•Jan 1, 2014•15 citations

Provably Secure Symmetric-Key Privacy-Preserving authenticated key agreement protocol

Liang Ni, Hengsheng Zhou, Yawei Zhang +2 more

In recent years, the rapid development of Quantum Computing technology has had a huge impact on the security of traditional Public Key Cryptography. However, the security of Hash functions and Symmetric Cryptographic algorithms is relatively less impacted by this security threaten and commonly have higher execution efficiency. This two primitives can offset the security impact by appropriately increasing the output scale of a Hash function and symmetric key respectively. Therefore, the Symmetric Key Authenticated Key Agreement(SAKA) protocol which constructed mainly by Hash functions and symmetric cryptographic algorithms has gradually attracted more attention. In this paper we proposed a provably secure SAKA scheme. We extend the security model used by Ferreira et al to formally prove the security of our protocol by introducing a criterion for indistinguishability of identities and Synchronization Robustness property. Our protocol not only captures basic security properties such as Perfect Forward Secrecy, Entity Authentication and Key Indistinguishability but also achieved Privacy Preservation and Full Synchronization Robustness. Furthermore, its implementation does not need to rely on a huge and complex Public key Infrastructure(PKI), so we can easily deploy it in a coucurrent environment. Comparison results indicate that the proposal consumes the least computation resource and reasonable communication cost among nine SAKA protocols while equiping 10 security properties.

International Conference on Communication and Network Security (ICCNS)•Dec 6, 2023•0 citations
Anonymity, robust synchronization, and perfect forward secrecy are the most important security properties of authenticated key agreement (AKA) protocols. Designing AKA protocols that simultaneously achieve these security properties and availability in the IoT environment is a challenging task. AKA protocols built using public key cryptographic primitives have advantages in achieving these critical security properties, but performing expensive public-key cryptographic operations is inefficient for resource-constrained IoT devices. The authentication protocols based on symmetric cryptographic primitives are often subject to various attacks. This paper proposes a secure lightweight AKA protocol with critical security properties (called CS-LAKA) for IoT environments without using public-key cryptographic primitives. LAKA cleverly achieves the security goals of anonymity, robust synchronization, and perfect forward secrecy by embedding dynamic identities in authenticators, and a few additional exchange messages are added. This enables LAKA to have both robust security and high efficiency. Subsequently, we perform a formal security analysis to prove that LAKA is secure, and compared with existing related schemes, LAKA has obvious advantages in terms of security, functionality and running performance.
In recent years, the rapid development of Quantum Computing technology has had a huge impact on the security of traditional Public Key Cryptography. However, the security of Hash functions and Symmetric Cryptographic algorithms is relatively less impacted by this security threaten and commonly have higher execution efficiency. This two primitives can offset the security impact by appropriately increasing the output scale of a Hash function and symmetric key respectively. Therefore, the Symmetric Key Authenticated Key Agreement(SAKA) protocol which constructed mainly by Hash functions and symmetric cryptographic algorithms has gradually attracted more attention. In this paper we proposed a provably secure SAKA scheme. We extend the security model used by Ferreira et al to formally prove the security of our protocol by introducing a criterion for indistinguishability of identities and Synchronization Robustness property. Our protocol not only captures basic security properties such as Perfect Forward Secrecy, Entity Authentication and Key Indistinguishability but also achieved Privacy Preservation and Full Synchronization Robustness. Furthermore, its implementation does not need to rely on a huge and complex Public key Infrastructure(PKI), so we can easily deploy it in a coucurrent environment. Comparison results indicate that the proposal consumes the least computation resource and reasonable communication cost among nine SAKA protocols while equiping 10 security properties.