<--- Back to Details
First PageDocument Content
Cryptography / Dining cryptographers problem / Secure multi-party computation / Secret sharing / Verifiable secret sharing / Public-key cryptography / Cryptographic protocol / Blob / David Chaum
Date: 2015-05-26 20:05:16
Cryptography
Dining cryptographers problem
Secure multi-party computation
Secret sharing
Verifiable secret sharing
Public-key cryptography
Cryptographic protocol
Blob
David Chaum

page bidon... MULTIPARTY UNCONDITIONALLY SECURE PROTOCOLS (Extended Abstract)

Add to Reading List

Source URL: www.chaum.com

Download Document from Source Website

File Size: 38,86 KB

Share Document on Facebook

Similar Documents

Scantegrity II: End-to-End Verifiability for Optical Scan Election Systems using Invisible Ink Confirmation Codes David Chaum Stefan Popoveniuc§ Richard Carback∗

DocID: 1viQo - View Document

Scantegrity II: End-to-End Verifiability for Optical Scan Election Systems using Invisible Ink Confirmation Codes David Chaum Stefan Popoveniuc§ Richard Carback∗

DocID: 1v2X7 - View Document

The Scantegrity Voting System and its Use in the Takoma Park Elections David Chaum Richard T. Carback Travis Mayberry Stefan Popoveniuc

DocID: 1uKV4 - View Document

Remotegrity: Design and Use of an End-to-End Verifiable Remote Voting System Filip Zag´orski1, Richard T. Carback2, David Chaum3 , Jeremy Clark4 , Aleksander Essex5 , and Poorvi L. Vora6 1

DocID: 1u1c6 - View Document

Computer Systems Established, Maintained and Trusted by Mutually Suspicious Groups By David Lee ~ha~ A.B. (University of California, San Diego) 1977

DocID: 1soea - View Document