Treffer: Undeniable signatures based on characters: How to sign with one bit
Title:
Undeniable signatures based on characters: How to sign with one bit
Authors:
Source:
PKC 2004 : public key cryptography (Singapore, 1-4 March 2004)Lecture notes in computer science. :69-85
Publisher Information:
Berlin: Springer, 2004.
Publication Year:
2004
Physical Description:
print, 18 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Logiciel, Software, Généralités, General, Approximation asymptotique, Asymptotic approximation, Aproximación asintótica, Choix, Choice, Elección, Complexité algorithme, Algorithm complexity, Complejidad algoritmo, Etalon, Standard, Marco, Méthode numérique, Numerical method, Método numérico, Norme, Standards, Norma, Offre, Offer, Oferta
Document Type:
Konferenz
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Swiss Federal Institute of Technology (EPFL) - LASEC, Switzerland
ISSN:
0302-9743
Rights:
Copyright 2004 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
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
Accession Number:
edscal.15672068
Database:
PASCAL Archive
Weitere Informationen
We present a new undeniable signature scheme which is based on the computation of characters. Our signature scheme offers the advantage of having an arbitrarily short signature. Its asymptotic complexity is attractive: the asymptotic complexity of all algorithms (even the key setup) are quadratic in the size of the modulus n in bits when the other parameters are fixed. The practical complexity can be quite low depending on parameter and variant choices. We present also a proof of security of our scheme containing the standard security requirements of an undeniable signature.