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

Constructing Confidential Channels from Authenticated Channels—Public-Key Encryption Revisited

Sandro Coretti, Ueli M. Maurer, Björn Tackmann

Published Jan 1, 2013• 21 citations
Publisher
DOI
10.1007/978-3-642-42033-7_8

Related papers

Two-Message Authenticated Key Exchange from Public-Key Encryption

You Lyu, Shengli Liu

Lecture notes in computer science•Jan 1, 2024•5 citations

Anonymity-preserving Public-Key Encryption: A Constructive Approach.

Markulf Kohlweiss, Ueli M. Maurer, Cristina Onete +2 more

Abstract. A receiver-anonymous channel allows a sender to send a message to a receiver without an adversary learning for whom the message is intended. Wireless broadcast channels naturally provide receiver anonymity, as does multi-casting one message to a receiver population containing the intended receiver. While anonymity and confidentiality appear to be orthogonal properties, making anonymous communication confidential is more involved than one might expect, since the ciphertext might reveal which public key has been used to encrypt. To address this problem, public-key cryptosystems with enhanced security properties have been proposed. We investigate constructions as well as limitations for preserving receiver anonymity when using public-key encryption (PKE). We use the constructive cryptography approach by Maurer and Renner and interpret cryptographic schemes as constructions of a certain ideal resource (e.g. a confidential anonymous channel) from given real resources (e.g. a broadcast channel). We define appropriate anonymous communication resources and show that a very natural resource can be constructed by using a PKE scheme which fulfills three properties that appear in cryptographic literature (IND-CCA, key-privacy, weak robustness). We also show that a desirable stronger variant, preventing the adversary from selective “trial-deliveries ” of messages, is unfortunately unachievable by any PKE scheme, no matter how strong. The constructive approach makes the guarantees achieved by applying a cryptographic scheme explicit in the constructed (ideal) resource; this specifies the exact requirements for the applicability of a cryptographic scheme in a given context. It also allows to decide which of the existing security properties of such a cryptographic scheme are adequate for the considered scenario, and which are too weak or too strong. Here, we show that weak robustness is necessary but that so-called strong robustness is unnecessarily strong in that it does not construct a (natural) stronger resource.

•Jan 1, 2013•0 citations

Public-channel cryptography

Margaret B. Cozzens, Steven Miller

Mathematical world•Sep 12, 2013•0 citations

Introduction to public-channel cryptography

Margaret B. Cozzens, Steven Miller

Mathematical world•Sep 12, 2013•0 citations

Two-Party Authenticated Key Agreement Protocol from Certificateless Public Key Encryption Scheme

Mengbo Hou, Qiuliang Xu

Authenticated key agreement protocol is the fundamental building block for secure communication in the open network to ensure authentication and confidentiality of e-commerce and e-government applications. Certificateless public key cryptography combines the advantage of the identity-based public key cryptography (ID-PKC) and the traditional PKI. In this paper, we present a secure and efficient two-party authenticated key agreement protocol based on an efficient and secure certificateless public key encryption scheme. It achieves almost all the known security attributes for authenticated key agreement protocol, such as perfect forward secrecy, PKG forward secrecy, key-compromise impersonation resilience, unknown key-share resilience, message independence and no key control. Compared to other comparable schemes, it is more secure and has nice efficiency.

International Conference on Management of e-Commerce and e-Government•Jan 1, 2009•4 citations

Building Key-Private Public-Key Encryption Schemes

Kenneth G. Paterson, Sriramkrishnan Srinivasan

Lecture notes in computer science•Jan 1, 2009•12 citations
Abstract. A receiver-anonymous channel allows a sender to send a message to a receiver without an adversary learning for whom the message is intended. Wireless broadcast channels naturally provide receiver anonymity, as does multi-casting one message to a receiver population containing the intended receiver. While anonymity and confidentiality appear to be orthogonal properties, making anonymous communication confidential is more involved than one might expect, since the ciphertext might reveal which public key has been used to encrypt. To address this problem, public-key cryptosystems with enhanced security properties have been proposed. We investigate constructions as well as limitations for preserving receiver anonymity when using public-key encryption (PKE). We use the constructive cryptography approach by Maurer and Renner and interpret cryptographic schemes as constructions of a certain ideal resource (e.g. a confidential anonymous channel) from given real resources (e.g. a broadcast channel). We define appropriate anonymous communication resources and show that a very natural resource can be constructed by using a PKE scheme which fulfills three properties that appear in cryptographic literature (IND-CCA, key-privacy, weak robustness). We also show that a desirable stronger variant, preventing the adversary from selective “trial-deliveries ” of messages, is unfortunately unachievable by any PKE scheme, no matter how strong. The constructive approach makes the guarantees achieved by applying a cryptographic scheme explicit in the constructed (ideal) resource; this specifies the exact requirements for the applicability of a cryptographic scheme in a given context. It also allows to decide which of the existing security properties of such a cryptographic scheme are adequate for the considered scenario, and which are too weak or too strong. Here, we show that weak robustness is necessary but that so-called strong robustness is unnecessarily strong in that it does not construct a (natural) stronger resource.
Authenticated key agreement protocol is the fundamental building block for secure communication in the open network to ensure authentication and confidentiality of e-commerce and e-government applications. Certificateless public key cryptography combines the advantage of the identity-based public key cryptography (ID-PKC) and the traditional PKI. In this paper, we present a secure and efficient two-party authenticated key agreement protocol based on an efficient and secure certificateless public key encryption scheme. It achieves almost all the known security attributes for authenticated key agreement protocol, such as perfect forward secrecy, PKG forward secrecy, key-compromise impersonation resilience, unknown key-share resilience, message independence and no key control. Compared to other comparable schemes, it is more secure and has nice efficiency.