Results 41 to 50 of about 95,809 (291)

IMPLEMENTASI TWO FACTOR AUTHENTICATION DAN PROTOKOL ZERO KNOWLEDGE PROOF PADA SISTEM LOGIN

open access: yesJuTISI (Jurnal Teknik Informatika dan Sistem Informasi), 2017
— This paper describes a login system utilizing Two Factor Authentication and Zero Knowledge Proof using Schnorr NIZK. The proposed system is designed to prevent password leak when being sent over insecure network or when used in an untrusted devices.
Willy Sudiarto Raharjo   +2 more
doaj   +1 more source

Zero-Knowledge Proofs of Proximity.

open access: yesIACR Cryptol. ePrint Arch., 2017
Interactive proofs of proximity (IPPs) are interactive proofs in which the verifier runs in time sub-linear in the input length. Since the verifier cannot even read the entire input, following the property testing literature, we only require that the verifier reject inputs that are far from the language (and, as usual, accept inputs that are in the ...
Berman, Itay   +2 more
openaire   +4 more sources

Honest Verifier Statistical Zero-Knowledge Equals General Statistical Zero-Knowledge [PDF]

open access: yes, 2011
We show how to transform any interactive proof system which is statistical zero-knowledge with respect to the honest-verifier, into a proof system which is statistical zero-knowledge with respect to any verifier.
Sahai, Amit   +3 more
core   +2 more sources

Zero-Knowledge Proof for Norinori

open access: yes, 2023
https://rdc.reed.edu/v1/resources/2df05b3e-de9f-49a6-8662-a38f8d5c0df0/thumb/128.jpgIn this thesis, we establish a formal notion of a puzzle. We discuss categorizing the varying degrees of difficulty of problems.
Elings-Haynie, Roscoe
core  

Card-Based Zero-Knowledge Proof for Sudoku [PDF]

open access: yes, 2018
In 2009, Gradwohl, Naor, Pinkas, and Rothblum proposed physical zero-knowledge proof protocols for Sudoku. That is, for a puzzle instance of Sudoku, their excellent protocols allow a prover to convince a verifier that there is a solution to the Sudoku ...
Sone, Hideaki   +2 more
core   +1 more source

Experimenting With Non-Interactive Range Proofs Based on the Strong RSA Assumption

open access: yesIEEE Access, 2019
Range proofs are proofs that a committed number m belongs to a range [a, b] for public constants a, b, without leaking any information about the value m.
Myungsun Kim, Hyung Tae Lee
doaj   +1 more source

An Efficient Zero-Knowledge Dual Membership Proof Supporting Pos-and-Neg Membership Decision

open access: yesMathematics, 2022
In this paper, we address the problem of secure decision of membership. We present a Zero-Knowledge Dual Membership Proof (ZKDMP) protocol, which can support positive and negative (Pos-and-Neg) membership decisions simultaneously.
Hongjian Yin   +4 more
doaj   +1 more source

Minimum Resource Zero-Knowledge Proofs [PDF]

open access: yes30th Annual Symposium on Foundations of Computer Science, 1989
Several resources relating to zero-knowledge protocols are considered. They are the number of envelopes used in the protocol, the number of oblivious transfer protocols executed during the protocol, and the total amount of communication required by the protocol.
J. Kilian, S. Micali, R. Ostrovsky
openaire   +1 more source

Five‐Year Disease Progression in Synuclein Seeding Positive Sporadic Parkinson's Disease

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective To provide a comprehensive description of disease progression in synuclein seeding assay (SAA) positive sporadic Parkinson Disease participants, using Neuronal Synuclein Disease integrated biological and functional impairment staging framework.
Paulina Gonzalez‐Latapi   +19 more
wiley   +1 more source

A Q‐Learning Algorithm to Solve the Two‐Player Zero‐Sum Game Problem for Nonlinear Systems

open access: yesInternational Journal of Adaptive Control and Signal Processing, Volume 39, Issue 3, Page 566-581, March 2025.
A Q‐learning algorithm to solve the two‐player zero‐sum game problem for nonlinear systems. ABSTRACT This paper deals with the two‐player zero‐sum game problem, which is a bounded L2$$ {L}_2 $$‐gain robust control problem. Finding an analytical solution to the complex Hamilton‐Jacobi‐Issacs (HJI) equation is a challenging task.
Afreen Islam   +2 more
wiley   +1 more source

Home - About - Disclaimer - Privacy