Universally verifiable multiparty computation from threshold homomorphic cryptosystems

Schoenmakers, B.

Universally verifiable multiparty computation from threshold homomorphic cryptosystems

Schoenmakers, B.

lecture notes in computer science (including subseries lecture notes in artificial intelligence and lecture notes in bioinformatics) 2015 Vol. 9092 pp. 3-22

77

schoenmakers2015universallylecture

Access

DOI:

10.1007/978-3-319-28166-7_1

Citation

ID: 61549

Ref Key: schoenmakers2015universallylecture

Use this key to autocite in SciMatic or Thesis Manager

References

No Bibliography

Blockchain Verification

Account:

NFT Contract Address:

0x95644003c57E6F55A65596E3D9Eac6813e3566dA

Article ID:

61549

Unique Identifier:

10.1007/978-3-319-28166-7_1

Network:

Scimatic Chain (ID: 481)

Blockchain Readiness Checklist

Authors

Abstract

Journal Name

Year

Title

4/5

Blockchain Upload Locked

Complete all 5 checklist items to tokenize your article

Gas fees required in SCI Coins

Buy SCI

Saymatik Web3.0 Wallet

Google Play

App Store

Coming soon

Reference Key: lastname+year+titlefirstword+journalfirstword

Article Type (Article, Book, Proceedings etc.)

Add a reference in a raw form. Our automatic system will correct it later.