Results 211 to 220 of about 514,807 (258)
Large Language Models in Colorectal Cancer Care and Clinical Decision Support: Systematic Review. [PDF]
J Med Internet ResTian J +5 more
europepmc +1 more source
WaterRAG: A Multiagent Retrieval-Augmented Generation Framework to Support Water Industry Transitions to Net-Zero. [PDF]
Environ Sci TechnolZhai M +7 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
SIAM Journal on Computing, 1991
Summary: This paper investigates the possibility of disposing of interaction between prover and verifier in a zero-knowledge proof if they share beforehand a short random string. Without any assumption, it is proven that noninteractive zero-knowledge proofs exist for some number-theoretic languages for which no efficient algorithm is known. If deciding
Giuseppe Persiano +2 more
exaly +3 more sources
Summary: This paper investigates the possibility of disposing of interaction between prover and verifier in a zero-knowledge proof if they share beforehand a short random string. Without any assumption, it is proven that noninteractive zero-knowledge proofs exist for some number-theoretic languages for which no efficient algorithm is known. If deciding
Giuseppe Persiano +2 more
exaly +3 more sources
Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98, 1998
Concurrent executions of a zero-knowledge protocol by a single prover (with one or more verifiers) may leak information and may not be zero-knowledge in toto . In this article, we study the problem of maintaining zero-knowledge.We introduce the notion of an (α, β) timing constraint : for any ...
Cynthia Dwork, Moni Naor, Amit Sahai
openaire +2 more sources
Concurrent executions of a zero-knowledge protocol by a single prover (with one or more verifiers) may leak information and may not be zero-knowledge in toto . In this article, we study the problem of maintaining zero-knowledge.We introduce the notion of an (α, β) timing constraint : for any ...
Cynthia Dwork, Moni Naor, Amit Sahai
openaire +2 more sources
Fundamenta Informaticae, 1999
We show how a standard deck of playing cards can be used to implement a secure multiparty protocol to compute any boolean function. Our contribution to previous work: no identical copies of cards are needed, and the number of necessary cards is reduced.
Valtteri Niemi, Ari Renvall
openaire +2 more sources
We show how a standard deck of playing cards can be used to implement a secure multiparty protocol to compute any boolean function. Our contribution to previous work: no identical copies of cards are needed, and the number of necessary cards is reduced.
Valtteri Niemi, Ari Renvall
openaire +2 more sources