Results 21 to 30 of about 7,889 (254)

Zero-Knowledge Proofs of Proximity.

IACR 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, Rothblum, Ron D., Vaikuntananthan, Vinod   +2 more
openaire   +5 more sources

MagmaFlow: A desktop platform for artificial intelligence‐driven expression analysis

FEBS Open Bio, EarlyView.
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, Ao Li, Eduardo H. Gilglioni, Mayank Bansal, Sumeet Pal Singh, Latifa Bakiri, Alessandra K. Cardozo, Esteban N. Gurzov   +7 more
wiley   +1 more source

Efficient Zero-Knowledge Proofs [PDF]

, 2011
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

Optimizing photoexcitation conditions for time‐resolved X‐ray solution scattering experiments

FEBS Open Bio, EarlyView.
Time‐resolved X‐ray solution scattering (TR‐XSS) is a powerful technique to visualize how proteins change their structure in real time after light activation. Selecting the right laser photoexcitation conditions—fluence, excitation geometry, and sample refresh rate—is critical to maximize the experimental signal while avoiding unwanted side effects ...
Matteo Levantino
wiley   +1 more source

Minimum Resource Zero-Knowledge Proofs [PDF]

30th 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

Annals 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, Caroline Gochanour, Seung Ho Choi, Hyunkeun Cho, Chelsea Caspell‐Garcia, Christopher Coffey, Michael Brumm, David‐Erick Lafontant, Yuge Xiao, Thomas Tropea, John Seibyl, Caroline Tanner, Charles S. Venuto, Karl Kieburtz, Lana M. Chahine, Kathleen L. Poston, Andrew Siderowf, Kenneth Marek, Tanya Simuni, The Parkinson's Progression Markers Initiative   +19 more
wiley   +1 more source

Sherlock Holmes zero-knowledge protocols secure against active attackers

Journal of Mathematical Cryptology
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

Revisiting NIZK-Based Technique for Chosen-Ciphertext Security: Security Analysis and Corrected Proofs

Applied Sciences, 2021
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, Dong Hoon Lee, Jong Hwan Park   +2 more
doaj   +1 more source

Disease Course After Anti‐CD20 Discontinuation in Secondary Progressive Multiple Sclerosis—A Multicenter Long‐Term Longitudinal Study

Annals of Clinical and Translational Neurology, EarlyView.
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, Dariia Kliushnikova, Richard Friedrich Radlberger, Sinan Yasaroglu, Tobias Moser, Andrea Harrer, Kitty Kratzer, Wolfgang Hitzl, Christiane Gradl, Martin Schmidauer, Patrick Roth, Harald Hegen, Peter Wipfler   +12 more
wiley   +1 more source

On the concrete complexity of zero-knowledge proofs [PDF]

, 2007
The fact that there are zero-knowledge proofs for all languages in NP has, potentially, enormous implications to cryptography. For cryptographers, the issue is no longer "which languages in NP have zero-knowledge proofs" but rather "which languages in NP have practical zero-knowledge proofs".
Joan Boyar, René Peralta 0001
openaire   +1 more source