Diclib.com
Dizionario ChatGPT

Ricerca nel dizionario Soluzioni personalizzate

Inserisci una parola o una frase in qualsiasi lingua 👆

Lingua:

Traduzione e analisi delle parole tramite l'intelligenza artificiale ChatGPT

In questa pagina puoi ottenere un'analisi dettagliata di una parola o frase, prodotta utilizzando la migliore tecnologia di intelligenza artificiale fino ad oggi:

come viene usata la parola
frequenza di utilizzo
è usato più spesso nel discorso orale o scritto
opzioni di traduzione delle parole
esempi di utilizzo (varie frasi con traduzione)
etimologia

Cosa (chi) è verifiable$89992$ - definizione

Publicly verifiable secret sharing

Publicly Verifiable Secret Sharing

In cryptography, a secret sharing scheme is publicly verifiable (PVSS) if it is a verifiable secret sharing scheme and if any party (not just the participants of the protocol) can verify the validity of the shares distributed by the dealer.

https://en.wikipedia.org/wiki/Publicly_Verifiable_Secret_Sharing

Verifiable random function

PUBLIC-KEY CRYPTOGRAPHIC PSEUDORANDOM FUNCTION

Verifiable unpredictable function

In cryptography, a verifiable random function (VRF) is a public-key pseudorandom function that provides proofs that its outputs were calculated correctly. The owner of the secret key can compute the function value as well as an associated proof for any input value.

https://en.wikipedia.org/wiki/Verifiable_random_function

Minimal reproducible example

SNIPPET OF SOURCE CODE THAT ALLOWS A BUG OR PROBLEM TO BE DEMONSTRATED AND REPRODUCED

Minimal Working Example; Minimal working example; Minimal workable example; Minimal complete verifiable example; Short self-contained correct example; Min-reprex

In computing, a minimal reproducible example (abbreviated MRE) is a collection of source code and other data files which allow a bug or problem to be demonstrated and reproduced. The important feature of a minimal reproducible example is that it is as small and as simple as possible, such that it is just sufficient to demonstrate the problem, but without any additional complexity or dependencies which will make resolution harder.

https://en.wikipedia.org/wiki/Minimal_reproducible_example

Wikipedia

Publicly Verifiable Secret Sharing

In cryptography, a secret sharing scheme is publicly verifiable (PVSS) if it is a verifiable secret sharing scheme and if any party (not just the participants of the protocol) can verify the validity of the shares distributed by the dealer.

In verifiable secret sharing (VSS) the object is to resist malicious players, such as
(i) a dealer sending incorrect shares to some or all of the participants, and
(ii) participants submitting incorrect shares during the reconstruction protocol,cf. [CGMA85].
In publicly verifiable secret sharing (PVSS), as introduced by Stadler [Sta96], it is an explicit goal that not just the participants can verify their own shares, but that anybody can verify that the participants received correct shares. Hence, it is explicitly required that (i) can be verified publicly.

The method introduced here according to the paper by Chunming Tang, Dingyi Pei, Zhuo Liu, and Yong He is non-interactive and maintains this property throughout the protocol.

https://en.wikipedia.org/wiki/Publicly Verifiable Secret Sharing