Catálogo de publicaciones - libros
Pairing-Based Cryptography-Pairing 2007: First International Conference, Tokyo, Japan, July 2-4, 2007. Proceedings
Tsuyoshi Takagi ; Tatsuaki Okamoto ; Eiji Okamoto ; Takeshi Okamoto (eds.)
En conferencia: 1º International Conference on Pairing-Based Cryptography (Pairing) . Tokyo, Japan . July 2, 2007 - July 4, 2007
Resumen/Descripción – provisto por la editorial
No disponible.
Palabras clave – provistas por la editorial
Coding and Information Theory; Data Encryption; Algorithm Analysis and Problem Complexity; Discrete Mathematics in Computer Science; Symbolic and Algebraic Manipulation
Disponibilidad
Institución detectada | Año de publicación | Navegá | Descargá | Solicitá |
---|---|---|---|---|
No detectada | 2007 | SpringerLink |
Información
Tipo de recurso:
libros
ISBN impreso
978-3-540-73488-8
ISBN electrónico
978-3-540-73489-5
Editor responsable
Springer Nature
País de edición
Reino Unido
Fecha de publicación
2007
Información sobre derechos de publicación
© Springer-Verlag Berlin Heidelberg 2007
Cobertura temática
Tabla de contenidos
Provably Secure Pairing-Based Convertible Undeniable Signature with Short Signature Length
Xinyi Huang; Yi Mu; Willy Susilo; Wei Wu
Undeniable signatures, introduced by Chaum and van Antwerpen, is a useful cryptography primitive to limit the publicly verifiable property of ordinary digital signatures. In an undeniable signature scheme, the validity or invalidity of the signature can only be verified via the confirmation/disavowal protocol with the help of the signer. An extended concept, convertible undeniable signatures, was introduced by Boyar, Chaum, Damgård and Pedersen. In the new concept, the signer can publish some selective proofs to convert one or more undeniable signatures into publicly verifiable ones, or issue a universal proof to make all his undeniable signatures publicly verifiable. In this paper, we first present a security model for convertible undeniable signature schemes, and then propose a new construction from bilinear pairings. Compared with the other schemes in the literature, the new construction has three advantages: Our scheme is both selectively and universally convertible; the signature length of our scheme is as short as BLS signature; meanwhile, all the security properties are formally proven under some conventional assumptions in the random oracle model.
Palabras clave: Undeniable Signatures; Convertible; Short Signature; Bilinear Pairings; Provable Security.
Pp. 367-391
Identity-Based Encryption: How to Decrypt Multiple Ciphertexts Using a Single Decryption Key
Fuchun Guo; Yi Mu; Zhide Chen
The beauty of identity-based encryption (IBE) lies in the convenience of public key handling, in the sense that any identification such as an email address, a name, or an IP number can serve as a public key of a party. However, such convenience is not inherited by a system where a party possesses many identities (e.g., many email addresses) and has to use them as his public keys. When this system is handled with a standard IBE, the user must manage all the private keys that are associated with all the public keys (identities). However, keeping these private keys is inconvenient to the user. In this paper, we solve this problem by proposing a novel identity-based encryption where we set a private key that maps multiple public keys (identities); namely, we can use a private key to decrypt multiple ciphertexts; each was encrypted with a different public key (identity).
Palabras clave: ID-based Encryption; Pairing.
Pp. 392-406