نتایج جستجو برای: is verifiable edward said

تعداد نتایج: 7248533  

Journal: :Streams of Consciousness 2019

2010
David Bismark

Transparent and verifiable elections can be achieved by end-to-end verifiable electronic voting systems. The purpose of such systems is to enable voters to verify the inclusion of their vote in the final tally while keeping the votes secret. Achieving verifiability and secrecy at the same time is hard and this thesis explores the properties of verifiable electronic voting systems and describes ...

Journal: :British medical journal 1986
M G Netsky

A love affair with dictionaries began when I was a schoolboy. My parents encouraged me to "look it up in the dictionary" whenever a word was questioned. It was an ingenuous time. The meaning of a word was enshrined in the dictionary, and words existed because they were recorded there. When someone said "ain't" we chanted, "Ain't ain't a word, because ain't ain't in the dictionary." The concept ...

Journal: :Archives of Clinical Neuropsychology 2019

Journal: :Proceedings on Privacy Enhancing Technologies 2023

The modern Internet is built on systems that incentivize collection of information about users. In order to minimize privacy loss, it desirable prevent these from collecting more than required for the application. promise multi-party computation data can be aggregated without revealing individual measurements collector. This work offers a provable security treatment "Verifiable Distributed Aggr...

Journal: :SSRN Electronic Journal 2011

Journal: :IEEE journal on selected areas in information theory 2021

Cloud computing platforms have created the possibility for computationally limited users to delegate demanding tasks strong but untrusted servers. Verifiable algorithms help build trust in such interactions by enabling server provide a proof of correctness his results which user can check very efficiently. In this article, we present doubly-efficient interactive algorithm verifiable polynomial ...

Journal: :Academic Journal of Interdisciplinary Studies 2013

Journal: :J. Comput. Syst. Sci. 1988
Gilles Brassard David Chaum Claude Crépeau

Protocols are given for allowing a “prover” to convince a “verifier” that the prover knows some verifiable secret information, without allowing the verifier to learn anything about the secret. The secret can be probabilistically or deterministically verifiable, and only one of the prover or the verifier need have constrained resources. This paper unifies and extends models and techniques previo...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید