Post-quantum Efficient Proof for Graph 3-Coloring Problem

Reference : Post-quantum Efficient Proof for Graph 3-Coloring Problem


	Document type :	E-prints/Working papers : Already available on another site
	Discipline(s) :	Engineering, computing & technology : Computer science
	Focus Areas :	Security, Reliability and Trust
	To cite this reference:	http://hdl.handle.net/10993/48607

Title :	Post-quantum Efficient Proof for Graph 3-Coloring Problem
Language :	English
Author, co-author :	Ebrahimi, Ehsan [University of Luxembourg > Faculty of Science, Technology and Medicine (FSTM) > Department of Computer Science (DCS) >]
Publication date :	2021
Peer reviewed :	No
Keywords :	[en] Efficient Interactive Proof System ; Post-quantum Security ; Computational Zero-knowledge
Target :	Researchers ; Professionals ; Students
Permalink :	http://hdl.handle.net/10993/48607
source URL :	https://eprint.iacr.org/2021/1286.pdf

File(s) associated to this reference

Fulltext file(s):

	File	Commentary	Version	Size	Access
Open access	SucPro-3-coloring.pdf		Author postprint	397.61 kB	View/Open

All documents in ORBi^lu are protected by a user license.