Theory of Cryptography

We present a general parallel-repetition theorem with an efficient reduction. As a corollary of this theorem we establish that parallel repetition reduces the soundness error at an exponential rate in any public-coin argument, and more generally, any argument where the verifier’s messages, but not necessarily its decision to accept or reject, can be efficiently simulated with noticeable probability.

[1]  James G. Oxley,et al.  Matroid theory , 1992 .

[2]  G. R. BLAKLEY.  Safeguarding cryptographic keys , 1979, 1979 International Workshop on Managing Requirements Knowledge (MARK).

[3]  Carles Padró,et al.  Ideal Multipartite Secret Sharing Schemes , 2007, Journal of Cryptology.

[4]  Carles Padró,et al.  Ideal secret sharing schemes whose minimal qualified subsets have at most three participants , 2009, Des. Codes Cryptogr..

[5]  Siaw-Lynn Ng,et al.  On the Composition of Matroids and Ideal Secret Sharing Schemes , 2001, Des. Codes Cryptogr..

[6]  Nira Dyn,et al.  Multipartite Secret Sharing by Bivariate Interpolation , 2008, Journal of Cryptology.

[7]  Siaw-Lynn Ng.  Ideal secret sharing schemes with multipartite access structures , 2006 .

[8]  Tamir Tassa.  Hierarchical Threshold Secret Sharing , 2004, TCC.

[9]  Moni Naor,et al.  A minimal model for secure computation (extended abstract) , 1994, STOC '94.

[10]  Michael J. Collins.  A Note on Ideal Tripartite Access Structures , 2002, IACR Cryptol. ePrint Arch..

[11]  Taher ElGamal,et al.  A public key cyryptosystem and signature scheme based on discrete logarithms , 1985 .

[12]  Germán Sáez,et al.  New Results on Multipartite Access Structures , 2006, IACR Cryptol. ePrint Arch..

[13]  László Csirmaz,et al.  The Size of a Share Must Be Large , 1994, Journal of Cryptology.

[14]  Tsuyoshi Takagi,et al.  Fast RSA-Type Cryptosystem Modulo pkq , 1998, CRYPTO.

[15]  Takayuki Hibi,et al.  Discrete Polymatroids , 2002 .

[16]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[17]  Enav Weinreb,et al.  Monotone circuits for monotone weighted threshold functions , 2006, Inf. Process. Lett..

[18]  Frantisek Matús,et al.  Matroid representations by partitions , 1999, Discret. Math..

[19]  Douglas R. Stinson,et al.  An explication of secret sharing schemes , 1992, Des. Codes Cryptogr..

[20]  Alfred Lehman,et al.  A Solution of the Shannon Switching Game , 1964 .

[21]  Kazuo Murota,et al.  Discrete convex analysis , 1998, Math. Program..

[22]  Carles Padró,et al.  Correction to "Secret Sharing Schemes With Bipartite Access Structure" , 2004, IEEE Trans. Inf. Theory.

[23]  Ehud D. Karnin,et al.  On secret sharing systems , 1983, IEEE Trans. Inf. Theory.

[24]  Jaume Martí Farré,et al.  On secret sharing schemes, matroids and polymatroids , 2010 .

[25]  Siaw-Lynn Ng.  A Representation of a Family of Secret Sharing Matroids , 2003, Des. Codes Cryptogr..

[26]  Josh Benaloh,et al.  Generalized Secret Sharing and Monotone Functions , 1990, CRYPTO.

[27]  Gustavus J. Simmons,et al.  How to (Really) Share a Secret , 1988, CRYPTO.

[28]  Weighted Threshold Secret Sharing Schemes , 1999, Inf. Process. Lett..

[29]  W. Erik Anderson,et al.  On the Secure Obfuscation of Deterministic Finite Automata , 2008, IACR Cryptol. ePrint Arch..

[30]  Tamir Tassa,et al.  Characterizing Ideal Weighted Threshold Secret Sharing , 2008, SIAM J. Discret. Math..

[31]  JM Jeroen Doumen,et al.  Some applications of coding theory in cryptography , 2003 .

[32]  Yuval Ishai,et al.  Perfect Constant-Round Secure Computation via Perfect Randomizing Polynomials , 2002, ICALP.

[33]  Adi Shamir,et al.  A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[34]  Ernest F. Brickell,et al.  Some Ideal Secret Sharing Schemes , 1990, EUROCRYPT.

[35]  Alfredo De Santis,et al.  On the Size of Shares for Secret Sharing Schemes , 1991, CRYPTO.

[36]  Carles Padró,et al.  Secret Sharing Schemes with Bipartite Access Structure , 1998, EUROCRYPT.

[37]  Pascal Paillier,et al.  Public-Key Cryptosystems Based on Composite Degree Residuosity Classes , 1999, EUROCRYPT.

[38]  Donald Beaver,et al.  Multiparty Computation with Faulty Majority (Extended Announcement) , 1989, FOCS 1989.

[39]  Gilles Brassard,et al.  Oblivious transfers and intersecting codes , 1996, IEEE Trans. Inf. Theory.

[40]  Ernest F. Brickell,et al.  On the classification of ideal secret sharing schemes , 1989, Journal of Cryptology.

[41]  Paul Seymour,et al.  A FORBIDDEN MINOR CHARACTERIZATION OF MATROID PORTS , 1976 .

[42]  James L. Massey,et al.  Minimal Codewords and Secret Sharing , 1999 .

[43]  Ivan Damgård,et al.  A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System , 2001, Public Key Cryptography.

[44]  F. Mat.  Two Constructions on Limits of Entropy Functions , 2007, IEEE Trans. Inf. Theory.

[45]  Omer Reingold,et al.  Statistically-hiding commitment from any one-way function , 2007, STOC '07.