Transitive Signature Schemes for Undirected Graphs from Lattices
- Authors
- Noh, Geontae; Jeong, Ik Rae
- Issue Date
- 30-6월-2019
- Publisher
- KSII-KOR SOC INTERNET INFORMATION
- Keywords
- Lattice-based cryptography; transitive signature; undirected graphs
- Citation
- KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS, v.13, no.6, pp.3316 - 3332
- Indexed
- SCIE
SCOPUS
KCI
- Journal Title
- KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS
- Volume
- 13
- Number
- 6
- Start Page
- 3316
- End Page
- 3332
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/64719
- DOI
- 10.3837/tiis.2019.06.030
- ISSN
- 1976-7277
- 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.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - School of Cyber Security > Department of Information Security > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.