Optimal Black-Box Secret Sharing over Arbitrary Abelian Groups
暂无分享,去创建一个
[1] Giovanni Di Crescenzo,et al. Multiplicative Non-abelian Sharing Schemes and their Application to Threshold Cryptography , 1994, ASIACRYPT.
[2] Yvo Desmedt,et al. Perfect Homomorphic Zero-Knowledge Threshold Schemes over any Finite Abelian Group , 1994, SIAM J. Discret. Math..
[3] Yuval Ishai,et al. Efficient Multi-party Computation over Rings , 2003, EUROCRYPT.
[4] Zoltán Ésik,et al. Temporal Logic with Cyclic Counting and the Degree of Aperiodicity of Finite Automata , 2001, Acta Cybern..
[5] Brian King,et al. Randomness Required for Linear Threshold Sharing Schemes Defined over Any Finite Abelian Group , 2001, ACISP.
[6] Giovanni Di Crescenzo,et al. Existence of multiplicative secret sharing schemes with polynomial share expansion , 1999, SODA '99.
[7] Olivier Danvy,et al. A Simple CPS Transformation of Control-Flow Information , 2002, Log. J. IGPL.
[8] Glynn Winskel,et al. Composing Strand Spaces , 2002, FSTTCS.
[9] Olivier Danvy,et al. Syntactic Theories in Practice , 2001, RULE@PLI.
[10] Ernest F. Brickell,et al. Some Ideal Secret Sharing Schemes , 1990, EUROCRYPT.
[11] K. Roberts,et al. Thesis , 2002 .
[12] Yvo Desmedt,et al. Threshold Cryptosystems , 1989, CRYPTO.
[13] R. Cramer,et al. Optimal Black-Box Secret Sharing over Arbitrary Abelian Groups , 2002 .
[14] Olivier Danvy,et al. Syntactic accidents in program analysis: on the impact of the CPS transformation , 2000, ICFP '00.
[15] Yvo Desmedt,et al. A Comment on the Efficiency of Secret Sharing Scheme over Any Finite Abelian Group , 1998, ACISP.
[16] Josh Benaloh,et al. Generalized Secret Sharing and Monotone Functions , 1990, CRYPTO.
[17] R. Tennant. Algebra , 1941, Nature.
[18] Adi Shamir,et al. How to share a secret , 1979, CACM.
[19] Moti Yung,et al. How to share a function securely , 1994, STOC '94.
[20] G. R. BLAKLEY. Safeguarding cryptographic keys , 1979, 1979 International Workshop on Managing Requirements Knowledge (MARK).
[21] Victor Shoup,et al. Practical Threshold Signatures , 2000, EUROCRYPT.
[22] van Me Marten Dijk. Secret key sharing and secret key generation , 1997 .
[23] Jens Groth. Extracting Witnesses from Proofs of Knowledge in the Random Oracle Model , 2001 .
[24] Thomas M. Cover,et al. Elements of Information Theory , 2005 .
[25] Avi Wigderson,et al. On span programs , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.
[26] Ingemar Ingemarsson,et al. A Construction of Practical Secret Sharing Schemes using Linear Block Codes , 1992, AUSCRYPT.
[27] Ueli Maurer,et al. General Secure Multi-party Computation from any Linear Secret-Sharing Scheme , 2000, EUROCRYPT.
[28] Claus Brabrand,et al. The bigwig Project , 2000 .
[29] Yvo Desmedt,et al. Some results in linear secret sharing , 2000 .
[30] Moti Yung,et al. Proactive RSA , 1997, CRYPTO.
[31] Yvo Desmedt,et al. Efficient Multiplicative Sharing Schemes , 1996, EUROCRYPT.
[32] Anna Gál,et al. Combinatorial methods in boolean function complexity , 1995 .
[33] Moti Yung,et al. Optimal-resilience proactive public-key cryptosystems , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[34] Lasse R. Nielsen. A Simple Correctness Proof of the Direct-Style Transformation , 2002 .
[35] Z. Ésik,et al. Equational Axioms for Probabilistic Bisimilarity (Preliminary Report) , 2002 .
[36] Anna Ingólfsdóttir,et al. A Formalization of Linkage Analysis , 2002 .