• Aucun résultat trouvé

Two-Party ECDSA from Hash Proof Systems and Efficient Instantiations

N/A
N/A
Protected

Academic year: 2021

Partager "Two-Party ECDSA from Hash Proof Systems and Efficient Instantiations"

Copied!
34
0
0

Texte intégral

Figure

Fig. 5: Two-Party ECDSA Key Generation and Signing Protocols from HPSs
Fig. 9: Experimental results (timings in ms, sizes in bits)

Références

Documents relatifs

In conclusion, each bounded connected component of the complement of the singular locus over a cylinder T i is glued with the unbounded component over the other cylinder through

The governance structure of the Lebanese Republic is particularly characterized by its confessional nature guaranteeing a pre-defined representation of Christians

(iii) a method to derive a full MPCS specification from a skeletal graph, including the TTP logic (Section 5); (iv) necessary and sufficient conditions for fairness of DAG

In this paper we gave an analysis for optimal parameters in cut-and-choose protocols to achieve: (a) minimum probability of undetected cheating for same- cost circuits and cheaper

The aim of the mERA-based eServices with trusted third party protocol is that a user could remotely use a privacy-preserving credential without disclosing his identity or personal

More precisely, if the server asks the first query, it is impossible to answer it, because we don’t know what is going to happen to the client afterwards: If the session was fresh

-Fifth anniversary of Hong Kong handover – Hong Kong Democratic Party chairman, Martin Lee Chu-ming, published a seven-point open letter to Jiang Zemin asking free entrance

A study sponsored by the United Nations on Belize revealed the extreme importance of political parties: “Political parties are the gatekeepers to the electoral