English
Related papers

Related papers: An efficient group authentication for group commun…

200 papers

We present a quantum multi-factor authentication mechanism based on the hidden-matching quantum communication complexity problem. It offers step-up graded authentication for users via a quantum token. In this paper, we outline the protocol,…

Cryptography and Security · Computer Science 2022-01-14 Hazel Murray , David Malone

Communication primitives play a central role in modern computing. They offer a panel of reliability and ordering guarantees for messages, enabling the implementation of complex distributed interactions. In particular, atomic broadcast is a…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-10-08 José Augusto Bolina , Pierre Sutra , Douglas Antunes Rocha , Lasaro Camargos

Multi-agents systems communication is a technology, which provides a way for multiple interacting intelligent agents to communicate with each other and with environment. Multiple-agent systems are used to solve problems that are difficult…

Multiagent Systems · Computer Science 2017-03-01 S. Ponomarev , A. E. Voronkov

Anonymity in networked communication is vital for many privacy-preserving tasks. Secure key distribution alone is insufficient for high-security communications, often knowing who transmits a message to whom and when must also be kept hidden…

Authentication and authorization of a user's identity are generally done by the service providers or identity providers. However, these centralized systems limit the user's control of their own identity and are prone to massive data leaks…

Cryptography and Security · Computer Science 2022-07-06 Shlok Gilda , Tanvi Jain , Aashish Dhalla

Authentication is the first defence mechanism in many electronic systems, including Internet of Things (IoT) applications, as it is essential for other security services such as intrusion detection. As existing authentication solutions…

Cryptography and Security · Computer Science 2023-07-10 Salem AlJanah , Ning Zhang , Siok Wah Tay

We show that a family of quantum authentication protocols introduced in [Barnum et al., FOCS 2002] can be used to construct a secure quantum channel and additionally recycle all of the secret key if the message is successfully…

Quantum Physics · Physics 2017-04-24 Christopher Portmann

In this paper, we consider the problem of secret key generation for multiple parties. Multi-user networks usually require a trusted party to efficiently distribute keys to the legitimate users and this process is a weakness against…

Cryptography and Security · Computer Science 2022-08-30 Ufuk Altun , Semiha T. Basaran , Gunes K. Kurt , Enver Ozdemir

As a popular application, mobile crowd sensing systems aim at providing more convenient service via the swarm intelligence. With the popularity of sensor-embedded smart phones and intelligent wearable devices, mobile crowd sensing is…

Cryptography and Security · Computer Science 2018-11-12 Jingwei Liu , Fanghui Cai , Longfei Wu , Rong Sun , Liehuang Zhu , Xiaojiang Du

In the secure groupcast problem, a transmitter wants to securely groupcast a message with the maximum rate to the first $N$ of $K$ receivers by broadcasting with the minimum bandwidth, where the $K$ receivers are each equipped with a key…

Information Theory · Computer Science 2020-06-11 Hua Sun

We introduce what --if some kind of group action exists-- is a truly (information theoretically) safe cryptographic communication system: a protocol which provides \emph{zero} information to any passive adversary having full access to the…

Cryptography and Security · Computer Science 2007-05-23 Pedro Fortuny Ayuso

We often assume that agent-to-agent interaction will mirror human conversation. However, agents operate fundamentally differently. What if they could develop communication patterns that are more efficient and better aligned with their…

Cryptography and Security · Computer Science 2026-02-03 Marco De Rossi

Identification schemes are interactive protocols typically involving two parties, a prover, who wants to provide evidence of his or her identity and a verifier, who checks the provided evidence and decide whether it comes or not from the…

This paper establishes the fundamental limits of a multi-access system where multiple users communicate to a legitimate receiver in presence of an external warden. Only a specific subset of the users, called covert users, needs their…

Information Theory · Computer Science 2024-08-26 Abdelaziz Bounhar , Mireille Sarkiss , Michèle Wigger

Imagine a group of citizens willing to collectively contribute their personal data for the common good to produce socially useful information, resulting from data analytics or machine learning computations. Sharing raw personal data with a…

Cryptography and Security · Computer Science 2021-12-24 Riad Ladjel , Nicolas Anciaux , Aurélien Bellet , Guillaume Scerri

Login notifications intend to inform users about sign-ins and help them protect their accounts from unauthorized access. Notifications are usually sent if a login deviates from previous ones, potentially indicating malicious activity. They…

Human-Computer Interaction · Computer Science 2024-04-02 Philipp Markert , Leona Lassak , Maximilian Golla , Markus Dürmuth

In this paper, we propose a multi-authority attribute-based signcryption scheme with efficient revocation for smart grid downlink communications. In the proposed scheme, grid operators and electricity vendors can send multicast messages…

Cryptography and Security · Computer Science 2026-02-24 Ahmad Alsharif , Ahmad Shafee , Mahmoud Nabil , Mohamed Mahmoud , Waleed S. Alasmary

Key management in multicast dynamic groups, where users can leave or join at their ease is one of the most crucial and essential part of secure communication. Various efficient management strategies have been proposed during last decade…

Cryptography and Security · Computer Science 2012-11-16 Muhammad Yasir Malik

Two protocols of quantum direct communication with authentication [Phys. Rev. A 73, 042305(2006)] were recently indicated to be insecure against the authenticator Trent's attacks [Phys. Rev. A 75, 026301(2007)]. We present two efficient…

Quantum Physics · Physics 2015-05-13 Liu Wen-jie , Chen Han-wu , Li Zhi-qiang , Liu Zhi-hao

The design and verification of cryptographic protocols is a notoriously difficult task, even in symbolic models which take an abstract view of cryptography. This is mainly due to the fact that protocols may interact with an arbitrary…

Cryptography and Security · Computer Science 2015-07-01 Myrto Arapinis , Stéphanie Delaune , Steve Kremer
‹ Prev 1 8 9 10 Next ›