Result: Short 2-move undeniable signatures

Title:
Short 2-move undeniable signatures
Authors:
MONNERAT, Jean, VAUDENAY, Serge
Source:
Progress in cryptology (VIETCRYPT 2006)0VIETCRYPT 2006. :19-36
Publisher Information:
Berlin; Heidelberg: Springer, 2006.
Publication Year:
2006
Physical Description:
print, 22 ref 1
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Telecommunications, Télécommunications, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Logiciel, Software, Organisation des mémoires. Traitement des données, Memory organisation. Data processing, Gestion des mémoires et des fichiers (y compris la protection et la sécurité des fichiers), Memory and file management (including protection and security), Intelligence artificielle, Artificial intelligence, Reconnaissance des formes. Traitement numérique des images. Géométrie algorithmique, Pattern recognition. Digital image processing. Computational geometry, Telecommunications et theorie de l'information, Telecommunications and information theory, Théorie de l'information, du signal et des communications, Information, signal and communications theory, Théorie du signal et des communications, Signal and communications theory, Cryptographie, Cryptography, Approche probabiliste, Probabilistic approach, Enfoque probabilista, Caractère manuscrit, Manuscript character, Carácter manuscrito, Cryptographie, Cryptography, Criptografía, Extensibilité, Scalability, Estensibilidad, Modélisation, Modeling, Modelización, Oracle, Protocole transmission, Transmission protocol, Protocolo transmisión, Reconnaissance caractère, Character recognition, Reconocimiento carácter, Signature électronique, Digital signature, Firma numérica, Sécurité informatique, Computer security, Seguridad informatica
Document Type:
Conference Conference Paper
File Description:
text
Language:
English
Author Affiliations:
EPFL, Switzerland
ISSN:
0302-9743
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=19105186
Rights:
Copyright 2007 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems

Telecommunications and information theory
Accession Number:
edscal.19105186
Database:
PASCAL Archive

Further Information

Attempting to reach a minimal number of moves in cryptographic protocols is a quite classical issue. Besides the theoretical interests, minimizing the number of moves can clearly facilitate practical implementations in environments with communication constraints. In this paper, we offer a solution to this problem in the context of undeniable signatures with interactive verification protocols by proposing a way to achieve these protocols in 2 moves. To this goal, we review a scheme we proposed at Asiacrypt 2004 whose property is the full scalability of the signature length against security. We slightly modify (to make it non-transferable) a 2-move version of this scheme which was mentioned in the original article without a proof of security. In the random oracle model, we prove the security of the modified version against an active adversary and precisely assess the security in terms of the signature length. To the best of our knowledge, this scheme is the first 2-move undeniable signature scheme with a security proof.