<--- 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

Bancor Protocol Continuous Liquidity for Cryptographic Tokens through their Smart Contracts Eyal Hertzog, Guy Benartzi, Galia Benartzi Edit and Mathematical Formulation by Omri Ross

DocID: 1v6Jq - View Document

A Cryptographic Analysis of the WireGuard Protocol Benjamin Dowling and Kenneth G. Paterson Information Security Group Royal Holloway, University of London ,

DocID: 1uTsV - View Document

Constraint Solving for Bounded-Process Cryptographic Protocol Analysis Jonathan Millen and Vitaly Shmatikov Computer Science Laboratory, SRI International, Menlo Park, CAUSA fmillen,

DocID: 1unhD - View Document

Abstract of “Static Analyses of Cryptographic Protocols” by Jay McCarthy, Ph.D., Brown University, May 2009 Most protocol analyses only address security properties. However, other properties are important and can inc

DocID: 1tO7E - View Document

Computing / Internet / Cryptographic protocols / Secure communication / Network architecture / Hypertext Transfer Protocol / Internet security / HTTPS / Crimeware / Internet privacy / Transport Layer Security / Bolt

Fighting Crimeware: An Architecture for Split-Trust Web Applications Richard Sharp, Anil Madhavapeddy, Roy Want, Trevor Pering, John Light IRC-TR

DocID: 1rthc - View Document