Efficient Identity-Based Signatures Secure in the Standard Model

Paterson, Kenneth G.; Schuldt, Jacob C. N.

doi:10.1007/11780656_18

Cited by 182 publications

(194 citation statements)

References 28 publications

(31 reference statements)

Supporting

Mentioning

192

Contrasting

Unclassified

Order By: Relevance

“…The attempts in ( [23,24]) show that a simple combination of Waters' ID-based encryption [30] and Paterson-Schuldt's ID-based signature [31] may not produce a secure ID-based signcryption. Therefore, the main contribution of this paper is to fill this gap by proposing an ID-based signcryption scheme whose security proof does not need to resort to the random oracle model.…”

Section: Our Contributionmentioning

confidence: 99%

A Novel Identity-Based Signcryption Scheme in the Standard Model

Huang

Yang

2017

Information

View full text Add to dashboard Cite

Identity-based signcryption is a useful cryptographic primitive that provides both authentication and confidentiality for identity-based crypto systems. It is challenging to build a secure identity-based signcryption scheme that can be proven secure in a standard model. In this paper, we address the issue and propose a novel construction of identity-based signcryption which enjoys IND-CCA security and existential unforgeability without resorting to the random oracle model. Comparisons demonstrate that the new scheme achieves stronger security, better performance efficiency and shorter system parameters.

show abstract

Section: Our Contributionmentioning

confidence: 99%

A Novel Identity-Based Signcryption Scheme in the Standard Model

Huang

Yang

2017

Information

View full text Add to dashboard Cite

show abstract

“…in [24] it is highlighted that the standard ISO/IEC 14888-2 [26] can be applied to derive identity-based multisignatures. Concerning implementations, there is an implementation of the [41] scheme in the JPBC library 13 and implementations of several schemes in Cayrel's website 14 .…”

Section: Identity-based Signaturesmentioning

confidence: 99%

Non-conventional Digital Signatures and Their Implementations—A Review

Arroyo

Díaz

Rodrı́guez

2015

Advances in Intelligent Systems and Computing

View full text Add to dashboard Cite

Esta es la versión de autor de la comunicación de congreso publicada en: This is an author produced version of a paper published in: Abstract. The current technological scenario determines a profileration of trust domains, which are usually defined by validating the digital identity linked to each user. This validation entails critical assumptions about the way users' privacy is handled, and this calls for new methods to construct and treat digital identities. Considering cryptography, identity management has been constructed and managed through conventional digital signatures. Nowadays, new types of digital signatures are required, and this transition should be guided by rigorous evaluation of the theoretical basis, but also by the selection of properly verified software means. This latter point is the core of this paper. We analyse the main non-conventional digital signatures that could endorse an adequate tradeoff betweeen security and privacy. This discussion is focused on practical software solutions that are already implemented and available online. The goal is to help security system designers to discern identity management functionalities through standard cryptographic software libraries.

show abstract

“…An IBS scheme with provable security in the standard model was given by Paterson and Schuldt in [54].…”

Section: Identity-based Signaturementioning

confidence: 99%

ID-Based Group Password-Authenticated Key Exchange

Tso

Okamoto

2009

Advances in Information and Computer Security

View full text Add to dashboard Cite

Abstract-Password-authenticated key exchange (PAKE) protocols are designed to be secure even when the secret key used for authentication is a human-memorable password. In this paper, we consider PAKE protocols in the group scenario, in which a group of clients, each of them shares a password with an "honest but curious" server, intend to establish a common secret key (i.e., a group key) with the help of the server. In this setting, the key established is known to the clients only and no one else, including the server. Each client needs to remember passwords only while the server keeps passwords in addition to private keys related to his identity. Towards our goal, we present a compiler that transforms any group key exchange (KE) protocol secure against a passive eavesdropping to a group PAKE which is secure against an active adversary who controls all communication in the network. This compiler is built on any group KE protocol (e.g., the Burmester-Desmedt protocol), any identity-based encryption (IBE) scheme (e.g., Gentry's scheme), and any identity-based signature (IBS) scheme (e.g., Paterson-Schuldt scheme). It adds only two rounds and O(1) communication (per client) to the original group KE protocol. As long as the underlying group KE protocol, IBE scheme and an IBS scheme have provably security without random oracles, a group PAKE constructed by our compiler can be proven to be secure without random oracles.

show abstract

Efficient Identity-Based Signatures Secure in the Standard Model

Cited by 182 publications

References 28 publications

A Novel Identity-Based Signcryption Scheme in the Standard Model

A Novel Identity-Based Signcryption Scheme in the Standard Model

Non-conventional Digital Signatures and Their Implementations—A Review

ID-Based Group Password-Authenticated Key Exchange

Contact Info

Product

Resources

About