Efficient computation outsourcing for inverting a class of homomorphic functions
暂无分享,去创建一个
Fangguo Zhang | Shengli Liu | Xu Ma | Fangguo Zhang | Shengli Liu | Xu Ma
[1] Silvio Micali,et al. The knowledge complexity of interactive proof-systems , 1985, STOC '85.
[2] Markus Jakobsson,et al. Secure Server-Aided Signature Generation , 2001, Public Key Cryptography.
[3] Vinod Vaikuntanathan,et al. How to Delegate and Verify in Public: Verifiable Computation from Attribute-based Encryption , 2012, IACR Cryptol. ePrint Arch..
[4] Improved Efficient Arguments , 2002 .
[5] Dan Boneh,et al. Evaluating 2-DNF Formulas on Ciphertexts , 2005, TCC.
[6] Manuel Barbosa,et al. Delegatable Homomorphic Encryption with Applications to Secure Outsourcing of Computation , 2012, CT-RSA.
[7] Elaine Shi,et al. Publicly Verifiable Delegation of Computation , 2011, IACR Cryptol. ePrint Arch..
[8] Eugene H. Spafford,et al. Secure outsourcing of scientific computations , 2001, Adv. Comput..
[9] Amr El Abbadi,et al. Dividing secrets to secure data outsourcing , 2014, Inf. Sci..
[10] Joe Kilian,et al. A note on efficient zero-knowledge proofs and arguments (extended abstract) , 1992, STOC '92.
[11] Brent Waters,et al. Dynamic Credentials and Ciphertext Delegation for Attribute-Based Encryption , 2012, IACR Cryptol. ePrint Arch..
[12] Yevgeniy Vahlis,et al. Verifiable Delegation of Computation over Large Datasets , 2011, IACR Cryptol. ePrint Arch..
[13] Craig Gentry,et al. Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers , 2010, CRYPTO.
[14] Payman Mohassel,et al. Efficient and Secure Delegation of Linear Algebra , 2011, IACR Cryptol. ePrint Arch..
[15] Chae Hoon Lim,et al. More Flexible Exponentiation with Precomputation , 1994, CRYPTO.
[16] Matthew Green,et al. Outsourcing the Decryption of ABE Ciphertexts , 2011, USENIX Security Symposium.
[17] Silvio Micali,et al. CS Proofs (Extended Abstracts) , 1994, FOCS 1994.
[18] Xiaolei Dong,et al. Security and privacy for storage and computation in cloud computing , 2014, Inf. Sci..
[19] László Babai,et al. Trading group theory for randomness , 1985, STOC '85.
[20] Ivan Damgård,et al. Linear zero-knowledge—a note on efficient zero-knowledge proofs and arguments , 1997, STOC '97.
[21] Jianfeng Ma,et al. New Algorithms for Secure Outsourcing of Modular Exponentiations , 2012, IEEE Transactions on Parallel and Distributed Systems.
[22] Silvio Micali,et al. CS proofs , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[23] Mariana Raykova,et al. Outsourcing Multi-Party Computation , 2011, IACR Cryptol. ePrint Arch..
[24] Craig Gentry,et al. Fully homomorphic encryption using ideal lattices , 2009, STOC '09.
[25] Mikhail J. Atallah,et al. Private and Cheating-Free Outsourcing of Algebraic Computations , 2008, 2008 Sixth Annual Conference on Privacy, Security and Trust.
[26] Elwyn R. Berlekamp,et al. On the inherent intractability of certain coding problems (Corresp.) , 1978, IEEE Trans. Inf. Theory.
[27] Mikhail J. Atallah,et al. Securely outsourcing linear algebra computations , 2010, ASIACCS '10.
[28] Henri Cohen,et al. A course in computational algebraic number theory , 1993, Graduate texts in mathematics.
[29] Yael Tauman Kalai,et al. Improved Delegation of Computation using Fully Homomorphic Encryption , 2010, IACR Cryptol. ePrint Arch..
[30] R. Cramer,et al. Linear Zero-Knowledgde. A Note on Efficient Zero-Knowledge Proofs and Arguments , 1996 .
[31] Yuval Ishai,et al. From Secrecy to Soundness: Efficient Verification via Secure Computation , 2010, ICALP.
[32] Yael Tauman Kalai,et al. Delegating computation: interactive proofs for muggles , 2008, STOC.
[33] Tanja Lange,et al. Computing Small Discrete Logarithms Faster , 2012, INDOCRYPT.