How deeply does Real-World Cryptography cover Shamir's Secret Sharing?

Explains dealer workflow, polynomial intuition, and MPC reconstruction, while omitting technical reasons behind interactive multiplication.

Shamir's Secret Sharing

As explained in Real-World Cryptography

Shamir’s secret sharing is a threshold secret-sharing scheme that distributes a secret as polynomial-derived shares reconstructible by a qualified subset of participants.

Shamir’s Secret Sharing splits a secret into separate shares so no single participant holds a usable key. A dealer creates and distributes the shares, then reconstructs the secret when cryptographic work is needed. section 8.8

The basic mechanism follows three ideas:

Treat the secret as a polynomial; random points on that polynomial become shares. section 8.8
Gather shares for reconstruction, then use the recovered secret for encryption or signing. section 8.8

Private inputs in MPC

In general-purpose multiparty computation, participants split private inputs, evaluate circuit gates using their shares, and reconstruct the output. Addition can happen locally; multiplication requires interaction. section 15.1.2

How Real-World Cryptography covers it

liveBook manning.com

Read Real-World Cryptography on liveBook Get the book at manning.com

Related concepts

secure multi-party computationuses · Secure multi-party computation is a cryptographic technique that enables multiple parties to jointly compute a function while keeping their private inputs concealed from one another.
secret sharingkind of · Secret sharing is a cryptographic technique that divides a secret into shares so authorized combinations of participants can reconstruct or use it.
secret shareproduces · A secret share is a portion of a secret distributed to a participant in a secret-sharing scheme.

This explainer was generated by Manning's knowledge graph from the text of Real-World Cryptography. The section links point to the parts of the book it draws on.