Space Efficient Computational Multi-Secret Sharing and Its Applications
暂无分享,去创建一个
[1] Amos Fiat,et al. How to Prove Yourself: Practical Solutions to Identification and Signature Problems , 1986, CRYPTO.
[2] Andrew Chi-Chih Yao,et al. Protocols for Secure Computations (Extended Abstract) , 1982, FOCS.
[3] David Pointcheval,et al. Dynamic Threshold Public-Key Encryption , 2008, CRYPTO.
[4] Mitsuru Ito,et al. Secret sharing scheme realizing general access structure , 1989 .
[5] Y. Yeh,et al. Dynamic Multi-Secret Sharing Scheme , 2008 .
[6] Germán Sáez,et al. New results and applications for multi-secret sharing schemes , 2014, Des. Codes Cryptogr..
[7] G. R. BLAKLEY. Safeguarding cryptographic keys , 1979, 1979 International Workshop on Managing Requirements Knowledge (MARK).
[8] Steven D. Galbraith,et al. Implementing the Tate Pairing , 2002, ANTS.
[9] Ehud D. Karnin,et al. On secret sharing systems , 1983, IEEE Trans. Inf. Theory.
[10] Giovanni Di Crescenzo,et al. Multi-Secret Sharing Schemes , 1994, CRYPTO.
[11] Michael O. Rabin,et al. Efficient dispersal of information for security, load balancing, and fault tolerance , 1989, JACM.
[12] Germán Sáez,et al. Sharing many secrets with computational provable security , 2013, Inf. Process. Lett..
[13] Nir Bitansky,et al. Erratum: Succinct Non-interactive Arguments via Linear Interactive Proofs , 2013, TCC.
[14] Keith M. Martin,et al. Multisecret Threshold Schemes , 1994, CRYPTO.
[15] Carles Padró,et al. Multi-linear Secret-Sharing Schemes , 2014, TCC.
[16] Jens Groth,et al. Short Pairing-Based Non-interactive Zero-Knowledge Arguments , 2010, ASIACRYPT.
[17] Yehuda Lindell,et al. On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation , 2006, CRYPTO.
[18] Helger Lipmaa,et al. Succinct Non-Interactive Zero Knowledge Arguments from Span Programs and Linear Error-Correcting Codes , 2013, IACR Cryptol. ePrint Arch..
[19] Hugo Krawczyk,et al. Secret Sharing Made Short , 1994, CRYPTO.
[20] Stefano Tessaro,et al. Asynchronous Verifiable Information Dispersal , 2005, DISC.
[21] Marten van Dijk,et al. A General Decomposition Construction for Incomplete Secret Sharing Schemes , 1998, Des. Codes Cryptogr..
[22] Huaxiong Wang,et al. Verifiable Multi-secret Sharing Schemes for Multiple Threshold Access Structures , 2007, Inscrypt.
[23] Adi Shamir,et al. How to share a secret , 1979, CACM.
[24] Helger Lipmaa,et al. Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments , 2012, TCC.
[25] Barbara Masucci. Sharing Multiple Secrets: Models, Schemes and Analysis , 2006, Des. Codes Cryptogr..
[26] Ueli Maurer,et al. A Dynamic Tradeoff Between Active and Passive Corruptions in Secure Multi-Party Computation , 2013, IACR Cryptol. ePrint Arch..
[27] C. P. Schnorr,et al. Efficient Identification and Signatures for Smart Cards (Abstract) , 1989, EUROCRYPT.