Non-malleable secret sharing
暂无分享,去创建一个
[1] Silas Richelson,et al. Textbook non-malleable commitments , 2016, STOC.
[2] R. J. McEliece,et al. On sharing secrets and Reed-Solomon codes , 1981, CACM.
[3] Adi Shamir,et al. How to share a secret , 1979, CACM.
[4] Vipul Goyal,et al. Non-malleable extractors and codes, with their many tampered extensions , 2015, IACR Cryptol. ePrint Arch..
[5] Stefan Dziembowski,et al. Intrusion-Resilient Secret Sharing , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[6] Salil P. Vadhan,et al. Constructing Locally Computable Extractors and Cryptosystems in the Bounded-Storage Model , 2003, Journal of Cryptology.
[7] Yongge Wang,et al. Perfectly Secure Message Transmission Revisited , 2002, IEEE Transactions on Information Theory.
[8] Kaoru Kurosawa,et al. Truly Efficient $2$-Round Perfectly Secure Message Transmission Scheme , 2009, IEEE Transactions on Information Theory.
[9] K. Srinathan,et al. Optimal Perfectly Secure Message Transmission , 2004, CRYPTO.
[10] Oded Goldreich,et al. Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity , 1988, SIAM J. Comput..
[11] Wen-Guey Tzeng,et al. Extracting randomness from multiple independent sources , 2005, IEEE Transactions on Information Theory.
[12] Yevgeniy Dodis,et al. Non-malleable Encryption: Simpler, Shorter, Stronger , 2016, Journal of Cryptology.
[13] G. R. Blakley,et al. Safeguarding cryptographic keys , 1899, 1979 International Workshop on Managing Requirements Knowledge (MARK).
[14] Xin Li,et al. Improved non-malleable extractors, non-malleable codes and independent source extractors , 2016, Electron. Colloquium Comput. Complex..
[15] P. MuraliKrishna,et al. SECURE SCHEMES FOR SECRET SHARING AND KEY DISTRIBUTION USING PELL'S EQUATION , 2013 .
[16] Stefan Dziembowski,et al. Non-Malleable Codes from Two-Source Extractors , 2013, IACR Cryptol. ePrint Arch..
[17] Vipul Goyal,et al. Witness Signatures and Non-Malleable Multi-Prover Zero-Knowledge Proofs , 2015, IACR Cryptol. ePrint Arch..
[18] Moti Yung,et al. Perfectly secure message transmission , 1993, JACM.
[19] Kaoru Kurosawa,et al. Truly efficient 2-round perfectly secure message transmission scheme , 2009, IEEE Trans. Inf. Theory.
[20] Gil Cohen,et al. Non-Malleable Extractors - New Tools and Improved Constructions , 2016, Electron. Colloquium Comput. Complex..
[21] Stefan Dziembowski,et al. Leakage-Resilient Non-malleable Codes , 2015, TCC.
[22] Guy N. Rothblum,et al. How to Compute in the Presence of Leakage , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.
[23] Shachar Lovett,et al. Non-malleable codes from additive combinatorics , 2014, STOC.
[24] Allison Bishop,et al. Storing Secrets on Continually Leaky Devices , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[25] Avi Wigderson,et al. Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.
[26] Stefan Dziembowski,et al. Leakage-Resilient Cryptography , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[27] Stefan Dziembowski,et al. Non-Malleable Codes , 2018, ICS.
[28] Venkatesan Guruswami,et al. Non-malleable Coding Against Bit-Wise and Split-State Tampering , 2013, Journal of Cryptology.
[29] Tal Rabin,et al. Verifiable secret sharing and multiparty protocols with honest majority , 1989, STOC '89.
[30] Kannan Srinathan,et al. On the Price of Proactivizing Round-Optimal Perfectly Secret Message Transmission , 2018, IEEE Transactions on Information Theory.
[31] Moni Naor,et al. Non-Malleable Cryptography (Extended Abstract) , 1991, STOC 1991.
[32] Ran Raz,et al. Extractors with weak random seeds , 2005, STOC '05.
[33] Vipul Goyal,et al. Non-Malleable Multi-Prover Interactive Proofs and Witness Signatures , 2016 .
[34] Feng-Hao Liu,et al. Tamper and Leakage Resilience in the Split-State Model , 2012, IACR Cryptol. ePrint Arch..
[35] Moni Naor,et al. Non-malleable cryptography , 1991, STOC '91.
[36] Rafail Ostrovsky,et al. Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data , 2004, SIAM J. Comput..
[37] Carles Padró,et al. Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors , 2008, EUROCRYPT.
[38] Amos Beimel,et al. Secret-Sharing Schemes: A Survey , 2011, IWCC.