Results 31 to 40 of about 8,896,164 (281)
Non-interactive zero-knowledge (NIZK) proofs for chosen-ciphertext security are generally considered to give an impractical construction. An interesting recent work by Seo, Abdalla, Lee, and Park (Information Sciences, July 2019) proposed an efficient ...
Youngkyung Lee +2 more
doaj +1 more source
Circuitree: A Datalog Reasoner in Zero-Knowledge
Driven by the increased consciousness in data ownership and privacy, zero-knowledge proofs (ZKPs) have become a popular tool to convince a third party of the truthfulness of a statement without disclosing any further information.
Tom Godden +5 more
doaj +1 more source
Zero-Knowledge Proofs of Proximity.
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 +5 more sources
Zero-Knowledge Proof in NuLink
NuLink provides privacy-preserving technology for decentralized applications via APIs. Users can securely store its valuable data, trade with others and so on. To ensure the privacy and security of service provided by NuLink, (zero-knowledge) proof systems are necessary.
Pawn, Rookie, Zhuan Cheng
openaire +3 more sources
MagmaFlow: A desktop platform for artificial intelligence‐driven expression analysis
MagmaFlow is a free, no‐code platform for gene expression analysis. It generates interactive volcano plots, links genes to literature, pathways, and diseases, prioritizes candidates using millions of publications, identifies affected biological processes, builds network diagrams, and exports publication‐ready figures and reports for macOS and Windows ...
Carlos E. Buss +7 more
wiley +1 more source
Sherlock Holmes zero-knowledge protocols secure against active attackers
We present two simple zero-knowledge interactive proofs that can be instantiated with many of the standard decisional or computational hardness assumptions.
Teşeleanu George
doaj +1 more source
Efficient Zero-Knowledge Proofs [PDF]
A zero-knowledge proof is a two-party protocol that enables a prover to convince a verifier of the truth of a statement without revealing anything else. Zero-knowledge proofs are widely used in cryptography to guarantee that parties are acting correctly without revealing their private information.
openaire +1 more source
ABSTRACT Objective To describe long‐term outcomes after anti‐CD20 discontinuation in selected patients with secondary progressive multiple sclerosis (SPMS) who remained without subsequent disease‐modifying therapy (DMT). Methods We retrospectively analyzed data from four centers in Austria and Switzerland.
Ferdinand Otto +12 more
wiley +1 more source
A Q‐Learning Algorithm to Solve the Two‐Player Zero‐Sum Game Problem for Nonlinear Systems
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
dynoGP: Deep Gaussian Processes for Dynamic System Identification
This work introduces a novel class of deep models for system identification, dynamical deep Gaussian processes, which combine the strengths of data‐driven methods, such as those based on neural network architectures, with the ability to output a probability distribution for uncertainty representation.
Alessio Benavoli +3 more
wiley +1 more source

