Reference : Post-quantum Efficient Proof for Graph 3-Coloring Problem
E-prints/Working papers : Already available on another site
Engineering, computing & technology : Computer science
Security, Reliability and Trust
Post-quantum Efficient Proof for Graph 3-Coloring Problem
Ebrahimi, Ehsan mailto [University of Luxembourg > Faculty of Science, Technology and Medicine (FSTM) > Department of Computer Science (DCS) >]
[en] Efficient Interactive Proof System ; Post-quantum Security ; Computational Zero-knowledge
Researchers ; Professionals ; Students

File(s) associated to this reference

Fulltext file(s):

Open access
SucPro-3-coloring.pdfAuthor postprint397.61 kBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.