File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: (Convertible) undeniable signatures without random oracles

Title(Convertible) undeniable signatures without random oracles
Authors
KeywordsPairings
Random oracle model
Convertible undeniable signature
Issue Date2007
Citation
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2007, v. 4861 LNCS, p. 83-97 How to Cite?
AbstractWe propose a convertible undeniable signature scheme without random oracles. Our construction is based on Waters' and Kurosawa and Heng's schemes that were proposed in Eurocrypt 2005. The security of our scheme is based on the CDH and the decision linear assumption. Comparing only the part of undeniable signatures, our scheme uses more standard assumptions than the existing undeniable signatures without random oracles due to Laguillamie and Vergnaud. © Springer-Verlag Berlin Heidelberg 2007.
Persistent Identifierhttp://hdl.handle.net/10722/260247
ISSN
2005 Impact Factor: 0.302
2015 SCImago Journal Rankings: 0.252

 

DC FieldValueLanguage
dc.contributor.authorYuen, Tsz Hon-
dc.contributor.authorAu, Man Ho-
dc.contributor.authorLiu, Joseph K.-
dc.contributor.authorSusilo, Willy-
dc.date.accessioned2018-09-12T02:00:53Z-
dc.date.available2018-09-12T02:00:53Z-
dc.date.issued2007-
dc.identifier.citationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2007, v. 4861 LNCS, p. 83-97-
dc.identifier.issn0302-9743-
dc.identifier.urihttp://hdl.handle.net/10722/260247-
dc.description.abstractWe propose a convertible undeniable signature scheme without random oracles. Our construction is based on Waters' and Kurosawa and Heng's schemes that were proposed in Eurocrypt 2005. The security of our scheme is based on the CDH and the decision linear assumption. Comparing only the part of undeniable signatures, our scheme uses more standard assumptions than the existing undeniable signatures without random oracles due to Laguillamie and Vergnaud. © Springer-Verlag Berlin Heidelberg 2007.-
dc.languageeng-
dc.relation.ispartofLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)-
dc.subjectPairings-
dc.subjectRandom oracle model-
dc.subjectConvertible undeniable signature-
dc.title(Convertible) undeniable signatures without random oracles-
dc.typeConference_Paper-
dc.description.natureLink_to_subscribed_fulltext-
dc.identifier.scopuseid_2-s2.0-38349036195-
dc.identifier.volume4861 LNCS-
dc.identifier.spage83-
dc.identifier.epage97-
dc.identifier.eissn1611-3349-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats