all InfoSec news
Three-Pass Identification Scheme Based on MinRank Problem with Half Cheating Probability. (arXiv:2205.03255v1 [cs.CR])
May 9, 2022, 1:20 a.m. | Bagus Santoso (The University of Electro-Communications), Yasuhiko Ikematsu (Kyushu University), Shuhei Nakamura (Nihon University), Takanori Yasuda (
cs.CR updates on arXiv.org arxiv.org
In Asiacrypt 2001, Courtois proposed the first three-pass zero-knowledge
identification (ID) scheme based on the MinRank problem. However, in a single
round of Courtois' ID scheme, the cheating probability, i.e., the success
probability of the cheating prover, is 2/3 which is larger than half. Although
Courtois also proposed a variant scheme which is claimed to have half cheating
probability, its security is not formally proven and it requires another
hardness assumption on a specific one-way function and that verifier always …
More from arxiv.org / cs.CR updates on arXiv.org
One-shot Empirical Privacy Estimation for Federated Learning
1 day, 6 hours ago |
arxiv.org
Transferability Ranking of Adversarial Examples
1 day, 6 hours ago |
arxiv.org
A survey on hardware-based malware detection approaches
1 day, 6 hours ago |
arxiv.org
Explainable Ponzi Schemes Detection on Ethereum
1 day, 6 hours ago |
arxiv.org
Jobs in InfoSec / Cybersecurity
SOC 2 Manager, Audit and Certification
@ Deloitte | US and CA Multiple Locations
Information Security Engineers
@ D. E. Shaw Research | New York City
Security Officer Level 1 (L1)
@ NTT DATA | Virginia, United States of America
Alternance - Analyste VOC - Cybersécurité - Île-De-France
@ Sopra Steria | Courbevoie, France
Senior Security Researcher, SIEM
@ Huntress | Remote US or Remote CAN
Cyber Security Engineer Lead
@ ASSYSTEM | Bridgwater, United Kingdom