Results 31 to 40 of about 514,807 (258)

An efficient identification protocol secure against concurrent-reset attacks

open access: yesJournal of Mathematical Cryptology, 2009
In this paper, first we discuss the security model for deterministic challenge-response identification protocols. For such protocols, we are able to simplify the CR2 security model in [Bellare, Fischlin, Goldwasser, and Micali, Identification protocols ...
Wu J., Stinson D. R.
doaj   +1 more source

A Post-Quantum Zero-Knowledge Identification Scheme [PDF]

open access: yesMathematics Interdisciplinary Research
‎In this paper‎, ‎we introduce a zero-knowledge identification protocol designed for authentication within the supersingular isogeny Diffie-Hellman (SIDH) key exchange framework‎.
Maryam Rezaei Kashi, Mojtaba Bahramian
doaj   +1 more source

Advancing Scholarship Management: A Blockchain-Enhanced Platform With Privacy-Secure Identities and AI-Driven Recommendations

open access: yesIEEE Access
Traditional scholarship management systems are often marred by inefficiencies, a lack of transparency, and significant concerns regarding data privacy.
Tu-Anh Nguyen-Hoang   +8 more
doaj   +1 more source

Modification of Diffie–Hellman Key Exchange Algorithm for Zero Knowledge Proof [PDF]

open access: yesEngineering and Technology Journal, 2012
Networks and entity groupings requires entity authentication while preserving the privacy of the entity being authenticated. Zero-Knowledge Proof (ZKP) plays an important role in authentication without revealing secret information.
Mahmood Khalel Ibrahim
doaj   +1 more source

Zero-knowledge proofs for finite field arithmetic, or: Can zero-knowledge be for free? [PDF]

open access: yesBRICS Report Series, 1997
We present zero-knowledge proofs and arguments for arithmetic circuits over finite prime fields, namely given a circuit, show in zero-knowledge that inputs can be selected leading to a given output. For a field GF(q), where q is an n-bit prime, a<br />circuit of size O(n), and error probability 2^−n, our protocols require communication of O(n^2 ...
Damgård, Ivan Bjerre, Cramer, Ronald
openaire   +2 more sources

PROTECTED LOCAL ACCESS BASED ON PHYSICALLY-DETERMINISTIC LINKS

open access: yesКомпютерні системи та інформаційні технології
This article proposes an approach to organizing protected local access based on physically-deterministic links for intelligent medical diagnostic systems.
Володимир КИСІЛЬ   +1 more
doaj   +1 more source

Zero-knowledge universal lossless data compression

open access: yesMATEC Web of Conferences, 2017
Advanced instrumentation, dealing with nanoscale technology at the current edge of human scientific enquiry, like X-Ray CT, generates an enormous quantity of data from single experiment.
Fiorini Rodolfo A.
doaj   +1 more source

Zero-Knowledge Proof

open access: yes, 2023
AbstractZero-knowledge proofs are techniques to verify claims without revealing the information itself. In this process, a “prover” shares proof of their claim with a “verifier,” who then verifies the accuracy of the proof without learning any additional information. It does not prove things with certainty.
openaire   +2 more sources

Zero Knowledge and Soundness Are Symmetric [PDF]

open access: yes, 2007
We give a complexity-theoretic characterization of the class of problems in NP having zero-knowledge argument systems. This characterization is symmetric in its treatment of the zero knowledge and the soundness conditions, and thus we deduce that the class of problems in NP ?
Shien Jin Ong, Salil P. Vadhan
openaire   +3 more sources

Skyscraper: Fast Hashing on Big Primes

open access: yesTransactions on Cryptographic Hardware and Embedded Systems
Arithmetic hash functions defined over prime fields have been actively developed and used in verifiable computation (VC) protocols. Among those, ellipticcurve- based SNARKs require large (256-bit and higher) primes. Such hash functions are notably slow,
Clémence Bouvier   +6 more
doaj   +1 more source

Home - About - Disclaimer - Privacy