
	Where results make sense

Topic: Secret sharing

Related Topics

Harry Potter and the Chamber of Secrets

secret society

Secret Service

The Secret Agent

secret police

trade secret

Secret Intelligence Service

secret identities

A Saucerful of Secrets

The Chamber of Secrets

top secret

The Secret Garden

In the News (Tue 29 Dec 09)

Northern Trust

Marvin Harrison

Peter Chernin

Gary Locke

Match Play

Penelope Cruz

Mickey Rourke

AR Rahman

Danny Boyle

Hugh Jackman

	Secret sharing - Wikipedia, the free encyclopedia
		Each secret share is a plane, and the secret is the point at which three shares intersect.
		In cryptography, secret sharing refers to any method for distributing a secret amongst a group of participants, each of which is allocated a share of the secret.
		Secret sharing was invented by both Adi Shamir and George Blakley independently in 1979.
	en.wikipedia.org /wiki/Secret_sharing (1663 words)

	ssss: Shamir's Secret Sharing Scheme
		secret amongst a group of participants, each of which is allocated a share of the secret.
		A clever user could use a secret sharing scheme to generate a set of shares for a given password and store one share in his address book, one in his bank deposit safe, leave one share with a friend, etc. If one day he forgets his password, he can reconstruct it easily.
		If larger secrets are to be shared a hybrid technique has to be applied: encrypt the secret with a block cipher (using openssl, gpg, etc) and apply secret sharing to just the key.
	point-at-infinity.org /ssss (619 words)

	[No title]
		The idea is to treat the secret as an m x b matrix (padding as necessary), with b depending on the length of the secret S (b >= m, b >= S/m).
		It may also be used to share a secret, requiring that m of the m+r partial secret holders agree to cooperate to reconstruct the secret.
		The secret is shared by having at least n+1 other integral points (i, P(i)) that are distributed to the partial secret holders.
	www.cise.ufl.edu /~nemo/security/notes.9 (789 words)

	Secret sharing: Facts and details from Encyclopedia Topic (Site not responding. Last check: 2007-10-12)
		Secret sharing was invented by both Adi Shamir Adi Shamir quick summary:
		Several secret sharing schemes are said to be information theoretically secure and can be proved to be so, EHandler: no quick summary.
		A verifiable secret sharing (VSS) scheme allows players to be certain that no other players are lying about the contents of their shares, EHandler: no quick summary.
	www.absoluteastronomy.com /encyclopedia/s/se/secret_sharing.htm (2779 words)

	Cryptography - Wikipedia, the free encyclopedia
		The term cryptography ("secret writing", from the Greek kryptós, "hidden," and gráphein, "to write") is often used to refer to the field as a whole, as is cryptology ("the study of secrets").
		The exact operation of a cipher is controlled by a key, a secret parameter (perhaps with several parts) for the cipher algorithms, at least in practically useful ciphers.
		Historically, ciphers were often used directly for encryption or decryption, but in modern techniques, a cipher is only one part of a cryptosystem, a set of algorithms, protocols, and operating procedures for encryption and decryption that use the cipher as one of the cooperating elements.
	en.wikipedia.org /wiki/Cryptography (4462 words)

	General Linear Secret Sharing
		Yao has recently shown that, based on a cryptographic assumption, a secret can be shared according to any monotone access structure using space proportional to the size of any monotone circuit describing that access structure.
		Secrets can be shared efficiently according to any access structure which previously admitted efficient secret sharing.
		While it is not hard to see that there are monotone access structures for which efficient, information theoretic secret sharing is impossible, it is not known whether this scheme is sufficient to efficiently implement any access structure for which an efficient scheme is possible.
	research.microsoft.com /Pubs/view.aspx?pubid=459 (216 words)

	RSA Security - 3.6.12 What are some secret sharing schemes?
		Shamir's secret sharing scheme [Sha79] is a threshold scheme based on polynomial interpolation.
		This scheme is not perfect, as the person with a share of the secret knows the secret is a point on his or her hyperplane.
		A further improvement allows each transparency (share) to be an innocent picture (for example, a picture of a landscape or a picture of a building), thus concealing the fact that secret sharing is taking place.
	www.rsasecurity.com /rsalabs/node.asp?id=2259 (582 words)

	CS 513 System Security -- Secret Sharing (Site not responding. Last check: 2007-10-12)
		As for the second share, it is the result of a random transformation, based on coin flipping, of the secret.
		In the even that a share is lost because of the collapse of one server, we still have two shares to recover the secret.
		We want the two servers with shares s1 and s2 to change their shares to s1' and s2', so that these two shares remain an (2,2) sharing of the same secret s and these two shares are independent from the old shares (cannot be inferred from the old shares).
	www.cs.cornell.edu /Courses/cs513/2000SP/SecretSharing.html (3828 words)

	Developing for Developers : Secret sharing
		This is called an (n,n) secret sharing scheme, because we have n shares and need n of them to reconstruct the secret.
		If we only know one share, then we just know one point, and for every T there is a line passing through (0, T) and that point; hence, the secret could be anything at all.
		This is called an (n,2) secret sharing scheme, because we have n shares and need 2 of them to reconstruct the secret.
	blogs.msdn.com /devdev/archive/2005/10/02/476273.aspx (1007 words)

	Secret Sharing (Site not responding. Last check: 2007-10-12)
		The basic idea in secret sharing is to divide the secret key into pieces and distribute the pieces to different persons so that certain subsets of the persons can get together to recover the key.
		The general model for secret sharing is called an m-out-of-n scheme (or (m,n)-threshold scheme) for integers 1 > m > n.
		The sender divides the secret into n parts and gives each participant one part so that any m parts can be put together to recover the secret, but any m - 1 parts reveal no information about the secret.
	paginas.fe.up.pt /~ee92035/sharing (238 words)

	[No title] (Site not responding. Last check: 2007-10-12)
		When all other participants honestly present their shadows in the secret reconstruction process, a dishonest participant can always exclusively derive the secret by presenting a fake shadow and thus the others get nothing but a fake secret.
		A secret sharing scheme is a method of breaking the secret, s, into n pieces, w1, w2,..., wn, with wi secretly distributed to ui, such that if A 1 U is a qualified subset of players according to the secret sharing policy, then s can only be reconstructed from shadows {si
		Fair Reconstruction of the Secret Suppose the dealer chooses a secret, s, in the domain of S to be shared by participants, u1, u2,..., un, according to a secret sharing policy.
	www.cstp.umkc.edu /~harnl/paper3/paper3.doc (610 words)

	2.2.1.2 Sum Secret Sharing
		Shamir's secret sharing protocol is flexible in that it allows the dealer to vary the number of players required to reconstruct the shared secret, by varying the degree of the polynomial p(x).
		If we wish to require all players to cooperate in order to be able to reconstruct the secret, then we do not need a secret sharing protocol as (relatively) complicated as Shamir's.
		Since each value for each individual share is equally likely, collecting together even n-1 of the shares affords no information about the secret.
	www.digitas.harvard.edu /~ken/cs262/election/node8.html (158 words)

	Visual Secret Sharing (ResearchIndex) (Site not responding. Last check: 2007-10-12)
		Secret sharing schemes are briey discussed to introduce the topic of secrect sharing.
		Visual secret sharing is examined, including Naor and Shamir's basic two-color visual secret sharing schemes.
		Secret Sharing Description Secret sharing schemes divide a block of data into n...
	citeseer.ist.psu.edu /430526.html (245 words)

	Q103: What are Secret Sharing Schemes?
		The general model for secret sharing is called an m-out-of-n scheme (or (m,n)-threshold scheme) for integers 1 m n.
		A secret sharing scheme is perfect if any group of at most m - 1 participants (insiders) has no advantage in guessing the secret over the outsiders.
		They represent two different ways of constructing such schemes, based on which more advanced secret sharing schemes can be designed.
	www.x5.net /faqs/crypto/q103.html (248 words)

	Secret Sharing Homomorphisms: Keeping Shares of a Secret Secret (Site not responding. Last check: 2007-10-12)
		This paper describes a homomorphism property attained by these and several other secret sharing schemes which allows multiple secrets to be combined by direct computation on shares.
		This property reduces the need for trust among agents and allows secret sharing to be applied to many new problems.
		One application described gives a method of verifiable secret sharing which is much simpler and more efficient than previous schemes.
	research.microsoft.com /research/pubs/view.aspx?pubid=231 (149 words)

	Quantum Secret Sharing (Site not responding. Last check: 2007-10-12)
		For instance, it is possible to share a secret among 3 people so that any two of them can reconstruct it, but any single person has no information about it.
		In fact, it is possible to share a secret among n people so that any k of them can reconstruct it, but any k-1 of them have no information about the secret, for any n and k.
		In addition, secret sharing is a necessary component for performing secure distributed computations among a number of people who do not completely trust each other.
	www.perimeterinstitute.ca /personal/dgottesman/QSS.html (522 words)

	PostSecret
		Inside are the most requested secrets from the website and many postcards that have never been seen before.
		You are invited to anonymously contribute your secrets to PostSecret.
		Each secret can be a regret, hope, funny experience, unseen kindness, fantasy, belief, fear, betrayal, erotic desire, feeling, confession, or childhood humiliation.
	postsecret.blogspot.com /#111488078687572857 (811 words)

	2.2.1.1 Shamir Secret Sharing
		It is easy to extend Shamir secret sharing to let the players compute any linear combination of secrets without gaining information on intermediate results of the computation.
		To add two shared secrets together, the players need only add together individual shares at each evaluation point; to multiply a shared secret by a known scalar, just multiply each share by that scalar.
		It is more difficult, though still possible, to compute the product of two secrets, provided that at least half of the players follow the protocol correctly.
	www.digitas.harvard.edu /~ken/cs262/election/node7.html (332 words)

	Implementing Secret Sharing In Python (Site not responding. Last check: 2007-10-12)
		There are various ways to share a secret; the simplest method doesn't require much more than high-school algebra.
		S is the secret we want to split up into N pieces, such that having M of them will allow reconstructing the secret.
		A share of the secret is then just a pair containing a random x and the result of F(x).
	www.amk.ca /python/writing/bignum.html (443 words)

	COrnell Data EXchange (CODEX): CODEX_VSS Namespace Reference
		Sharings are labelled as a means to distinguish different sharings of the same secret.
		Serializable class holding the verification information for a secret and the arguments needed to construct the one-way function used to compute and test verification shares.
		This undefined template class allows us to build a particular verifiable secret sharing reconstruction scheme that is consistent for a given type of sharing and one-way function.
	www.umiacs.umd.edu /~mmarsh/CODEX/src_doc/namespaceCODEX__VSS.html (212 words)

	Secret Sharing Tool
		Secret Sharing is a cryptographic technology to split a secret message in a way so that n out of m shares (assuming each share is for a person: out of m persons) have to be available before the secret can be revealed.
		This is a proof of concept implementation that uses this technique to share the encryption key to a file so that n of m persons are needed to decrypt the file.
		The first n secrets are read and the matrixes are filled with the coefficients (1, x, x^2, x^3,...) and the k's.
	silmor.de /5 (858 words)

	Kryptographie FAQ: Frage 104: What is Shamir's Secret Sharing Scheme? (Site not responding. Last check: 2007-10-12)
		Shamir's secret sharing scheme [Sha79] is an interpolating scheme based on polynomial interpolation.
		Therefore, Shamir's scheme is a perfect secret sharing scheme (see Question 103).
		With just a single share (point), the line can be any line that passes the point, and hence the secret can be any point on the y-axis.
	www.iks-jena.de /mitarb/lutz/security/cryptfaq/q104.html (205 words)

	The Mathematics of Communication: lecture #3 (Site not responding. Last check: 2007-10-12)
		I extended the question, and asked how to share secrets so that it would take, say, 17 people to reconstruct the secret while any group of 16 would not have sufficient information.
		Radimirovic, an expert on these schemes, said that as far as he knew, every secret sharing scheme was essentially the same as this one.
		For example, the case of medical record privacy: in Britain, secret sharing is used to secure medical records.
	www.math.rutgers.edu /~greenfie/teaching/display/L3.html (547 words)

	[No title]
		VSS - Verifiable Secret Sharing In the previous scheme we assumed that the Dealer is reliable, however, a misbehaving dealer can deal inconsistent shares to the participants, from which they will not be able to reconstruct a secret.
		The problem of verifiable secret sharing is to convince shareholders that their shares (collectively) are,t-Consistent, meaning that every subset of t shares out of n (that the Dealer distributed) defines the same secret.
		Both versions allow the validity of secret shares to be verified without their being revealed; a shareholder can obtain high confidence that he/she holds a valid share of the secret rather than a useless random number.
	www.cs.huji.ac.il /~ns/SS.doc (2732 words)

	M5410 - Secret Sharing Schemes
		He would like a way to give out parts (shares) of the combination (the secret) so that any two of the vice presidents can combine their information and open the vault, or any one of the vice presidents and any three of the senior tellers can open the vault.
		The secret, K, is an element of this field.
		Let the secret be the coordinates of a fixed point on a given line in a plane (the line and the fact that the secret is a point on that line is public information).
	www-math.cudenver.edu /~wcherowi/courses/m5410/ctcsss.html (987 words)

	Bibliography on Secret Sharing Schemes (Site not responding. Last check: 2007-10-12)
		Chor, S. Goldwasser, S. Micali and B. Awerbuch, Verifiable secret sharing and achieving simultaneity in the presence of faults, in "Proceedings of the 26th IEEE Symposium on the Foundations of Computer Science", IEEE Press, 1985, 383-395.
		Cooper, D. Donovan and J. Seberry, Secret sharing schemes arising from latin squares, Bulletin of the Institute of Combinatorics and its Applications 12 (1994), 33-43.
		Simmons, W.-A. Jackson and K. Martin, The geometry of shared secret schemes, Bulletin of the Institute of Combinatorics and its Applications 1 (1991), 71-88.
	www.cacr.math.uwaterloo.ca /~dstinson/ssbib.html (5439 words)

	SPIE Bookstore (Site not responding. Last check: 2007-10-12)
		We present an experimental scheme to perform continuous variable (2,3) threshold quantum secret sharing on the quadratures amplitudes of bright light beams.
		We examine the efficacy of quantum secret sharing in terms of fidelity, as well as the signal transfer coefficients and the conditional variances of the reconstructed output state.
		We discuss two different definitions of quantum secret sharing: the sharing of a quantum secret and the sharing of a classical secret with quantum resources.
	bookstore.spie.org /index.cfm?fuseaction=detailpaper&cachedsearch=1&productid=505349&producttype=pdf&CFID=643904&CFTOKEN=62202074 (185 words)

	Shamir's Secret Sharing
		They wish to lock up the documents in a cabinet so that the cabinet can be opened if and only if six or more of the scientists are present.
		In this paper we generalize the problem to one in which the secret is some data D (e.g., the safe combination) and in which nonmechanical solutions (which manipulate this data) are also allowed.
		If each executive is given a copy of the company's secret signature key, the system is convenient but easy to misuse.
	szabo.best.vwh.net /secret.html (1276 words)

Try your search on: Qwika (all wikis)