Back to Results
First PageMeta Content
Secret sharing / Secure multi-party computation / Information / Cyberwarfare / Security / Polynomials / Orthogonal polynomials / Cryptographic protocols / Cryptography / Verifiable secret sharing


Round-Optimal and Efficient Verifiable Secret Sharing Matthias Fitzi1? , Juan Garay2?? , Shyamnath Gollakota3? ? ? , C. Pandu Rangan3† , and Kannan Srinathan4 1
Add to Reading List

Document Date: 2007-04-05 18:50:42

Open Document

File Size: 153,99 KB

Share Result on Facebook

City

Barcelona / /

Company

Pi / Lucent Technologies / /

Country

Denmark / /

Currency

pence / /

/

Event

FDA Phase / /

Facility

International Institute of Information Technology / Aarhus University / /

IndustryTerm

secure multi-party protocols / round protocol / above protocol / round-optimal and player-optimal protocol / secure solution / n-player protocol / secret-sharing protocol / round-optimal protocols / synchronous network / connected network / /

Organization

Aarhus University / Department of Computer Science and Engineering / Department of Computer Science / Centre de Recerca Matem` / International Institute of Information Technology / European Commission / /

Person

Rabin / Murray Hill / Pi / Pj / /

/

Position

K. Player / happy player / player / uncorrupted player / corrupted player / dealer / designated player / honest player / dishonest player / /

Product

VSS / WSS / /

RadioStation

CORE / /

Technology

VSS protocol / above protocol / Information Technology / round protocol / 3t The protocol / VSS protocols / three-round protocol / secure multi-party protocols / resulting protocol / resulting VSS protocol / Cryptography / three-round protocols / secret-sharing protocol / WSS protocols / n-player protocol / WSS protocol / main protocol / /

SocialTag