Login
EN
[EN] English
[FR] Français
Login
EN
[EN] English
[FR] Français
Give us feedback
Search and explore
Search
Explore ORBilu
Open Science
Open Science
Open Access
Research Data Management
Definitions
OS Working group
Webinars
Statistics
Help
Your ORBilu journey: new or leaving UL
User Guide
FAQ
Publication list
Document types
Reporting
Training
ORCID
About
About ORBilu
Deposit Mandate
ORBilu team
Impact and visibility
About statistics
About metrics
OAI-PMH
Project history
Legal Information
Data protection
Legal notices
Add a publication
Back
Home
Post-quantum Efficient Proof for Graph 3-Coloring Problem - 2021
Download
Eprint already available on another site (E-prints, Working papers and Research blog)
Post-quantum Efficient Proof for Graph 3-Coloring Problem
EBRAHIMI, Ehsan
2021
Permalink
https://hdl.handle.net/10993/48607
Files (1)
Send to
Details
Statistics
Bibliography
Similar publications
Files
Full Text
SucPro-3-coloring.pdf
Author postprint (407.16 kB)
Download
All documents in ORBilu are protected by a
user license
.
Send to
RIS
BibTex
APA
Chicago
Permalink
X
Linkedin
copy to clipboard
copied
Details
Keywords :
Efficient Interactive Proof System; Post-quantum Security; Computational Zero-knowledge
Disciplines :
Computer science
Author, co-author :
EBRAHIMI, Ehsan
;
University of Luxembourg > Faculty of Science, Technology and Medicine (FSTM) > Department of Computer Science (DCS)
Language :
English
Title :
Post-quantum Efficient Proof for Graph 3-Coloring Problem
Publication date :
2021
Source :
https://eprint.iacr.org/2021/1286.pdf
Focus Area :
Security, Reliability and Trust
Available on ORBilu :
since 16 November 2021
Statistics
Number of views
211 (22 by Unilu)
Number of downloads
208 (43 by Unilu)
More statistics
Bibliography
Similar publications
Contact ORBilu
