test
server time: root: http://itiis.org
current_path: /journals/tiis/digital-library/22144
current_url: http://itiis.org/journals/tiis/digital-library/22144
Transitive Signature Schemes for Undirected Graphs from Lattices
  • KSII Transactions on Internet and Information Systems
    Monthly Online Journal (eISSN: 1976-7277)

Transitive Signature Schemes for Undirected Graphs from Lattices

Vol. 13, No. 6, June 29, 2019
10.3837/tiis.2019.06.030, Download Paper (Free):

Abstract

In a transitive signature scheme, a signer wants to authenticate edges in a dynamically growing and transitively closed graph. Using transitive signature schemes it is possible to authenticate an edge (i, k), if the signer has already authenticated two edges (i, j) and (j, k). That is, it is possible to make a signature on (i, k) using two signatures on (i, j) and (j, k). We propose the first transitive signature schemes for undirected graphs from lattices. Our first scheme is provably secure in the random oracle model and our second scheme is provably secure in the standard model.


Statistics

Show / Hide Statistics

Statistics (Cumulative Counts from December 1st, 2015)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article

[IEEE Style]
G. Noh and I. R. Jeong, "Transitive Signature Schemes for Undirected Graphs from Lattices," KSII Transactions on Internet and Information Systems, vol. 13, no. 6, pp. 3316-3332, 2019. DOI: 10.3837/tiis.2019.06.030.

[ACM Style]
Geontae Noh and Ik Rae Jeong. 2019. Transitive Signature Schemes for Undirected Graphs from Lattices. KSII Transactions on Internet and Information Systems, 13, 6, (2019), 3316-3332. DOI: 10.3837/tiis.2019.06.030.