Efficient algorithms for secure outsourcing of bilinear pairings
暂无分享,去创建一个
Jianfeng Ma | Qiang Tang | Jin Li | Duncan S. Wong | Willy Susilo | Xiaofeng Chen | Shaohua Tang | W. Susilo | Qiang Tang | Jianfeng Ma | Shaohua Tang | D. Wong | Xiaofeng Chen | Jin Li
[1] Ran Canetti,et al. Practical delegation of computation using multiple servers , 2011, CCS '11.
[2] Aggelos Kiayias,et al. Traceable Signatures , 2004, EUROCRYPT.
[3] Mikhail J. Atallah,et al. Private and Cheating-Free Outsourcing of Algebraic Computations , 2008, 2008 Sixth Annual Conference on Privacy, Security and Trust.
[4] Radu Sion,et al. Conditional E-Cash , 2007, Financial Cryptography.
[5] Silvio Micali,et al. The Knowledge Complexity of Interactive Proof Systems , 1989, SIAM J. Comput..
[6] David Naccache,et al. Secure Delegation of Elliptic-Curve Pairing , 2010, IACR Cryptol. ePrint Arch..
[7] Marina Blanton,et al. Secure Outsourcing of DNA Searching via Finite Automata , 2010, DBSec.
[8] Mikhail J. Atallah,et al. Secure and Efficient Outsourcing of Sequence Comparisons , 2012, ESORICS.
[9] Sean W. Smith,et al. Batch Pairing Delegation , 2007, IWSEC.
[10] Francisco Rodríguez-Henríquez,et al. High-Speed Software Implementation of the Optimal Ate Pairing over Barreto-Naehrig Curves , 2010, Pairing.
[11] Manuel Blum,et al. Self-Testing/Correcting with Applications to Numerical Problems , 1993, J. Comput. Syst. Sci..
[12] Matthew K. Franklin,et al. Identity-Based Encryption from the Weil Pairing , 2001, CRYPTO.
[13] Eugene H. Spafford,et al. Secure outsourcing of scientific computations , 2001, Adv. Comput..
[14] David A. Wagner,et al. Proceedings of the 20th USENIX conference on Security , 2011 .
[15] Joe Kilian,et al. Improved Efficient Arguments (Preliminary Version) , 1995, CRYPTO.
[16] Kenneth G. Paterson,et al. Pairings for Cryptographers , 2008, IACR Cryptol. ePrint Arch..
[17] Mikhail J. Atallah,et al. Securely outsourcing linear algebra computations , 2010, ASIACCS '10.
[18] Ramarathnam Venkatesan,et al. Speeding up Discrete Log and Factoring Based Schemes via Precomputations , 1998, EUROCRYPT.
[19] Moon Sung Lee,et al. Efficient Delegation of Pairing Computation , 2005, IACR Cryptol. ePrint Arch..
[20] Marina Blanton. Improved Conditional E-Payments , 2008, ACNS.
[21] Craig Gentry,et al. Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers , 2010, CRYPTO.
[22] Bogdan Carbunar,et al. Fair Payments for Outsourced Computations , 2010, 2010 7th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON).
[23] Marc Girault,et al. Server-Aided Verification: Theory and Practice , 2005, ASIACRYPT.
[24] Philippe Golle,et al. Uncheatable Distributed Computations , 2001, CT-RSA.
[25] M. Scott. Implementing cryptographic pairings , 2007 .
[26] Jianfeng Ma,et al. New Algorithms for Secure Outsourcing of Modular Exponentiations , 2012, IEEE Transactions on Parallel and Distributed Systems.
[27] Mikhail J. Atallah,et al. Secure outsourcing of sequence comparisons , 2004, International Journal of Information Security.
[28] Claus-Peter Schnorr,et al. Efficient signature generation by smart cards , 2004, Journal of Cryptology.
[29] Willy Susilo,et al. Server-aided signatures verification secure against collusion attack , 2011, ASIACCS '11.
[30] Cong Wang,et al. Secure and practical outsourcing of linear programming in cloud computing , 2011, 2011 Proceedings IEEE INFOCOM.
[31] Bogdan Carbunar,et al. Conditional Payments for Computing Markets , 2008, CANS.
[32] Silvio Micali,et al. CS proofs , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[33] Martín Abadi,et al. On hiding information from an oracle , 1987, STOC '87.
[34] Yevgeniy Vahlis,et al. Verifiable Delegation of Computation over Large Datasets , 2011, IACR Cryptol. ePrint Arch..
[35] Paulo S. L. M. Barreto,et al. Efficient pairing computation on supersingular Abelian varieties , 2007, IACR Cryptol. ePrint Arch..
[36] Anna Lysyanskaya,et al. How to Securely Outsource Cryptographic Computations , 2005, TCC.
[37] Alfred Menezes,et al. Pairing-Based Cryptography at High Security Levels , 2005, IMACC.
[38] Jung Hee Cheon,et al. An Identity-Based Signature from Gap Diffie-Hellman Groups , 2003, Public Key Cryptography.
[39] Yvo Desmedt. Public Key Cryptography — PKC 2003 , 2002, Lecture Notes in Computer Science.
[40] Jianfeng Ma,et al. New Algorithms for Secure Outsourcing of Modular Exponentiations , 2014, IEEE Trans. Parallel Distributed Syst..
[41] Yael Tauman Kalai,et al. Delegating computation: interactive proofs for muggles , 2008, STOC.
[42] Elisabeth Oswald,et al. A Comprehensive Evaluation of Mutual Information Analysis Using a Fair Evaluation Framework , 2011, CRYPTO.
[43] Hovav Shacham,et al. Short Signatures from the Weil Pairing , 2001, J. Cryptol..
[44] David Chaum,et al. Wallet Databases with Observers , 1992, CRYPTO.
[45] Hideki Imai,et al. Speeding Up Secret Computations with Insecure Auxiliary Devices , 1988, CRYPTO.
[46] Marina Blanton,et al. Secure outsourced computation of iris matching , 2012, J. Comput. Secur..
[47] Antoine Joux,et al. A One Round Protocol for Tripartite Diffie–Hellman , 2000, Journal of Cryptology.
[48] Vinod Vaikuntanathan,et al. How to Delegate and Verify in Public: Verifiable Computation from Attribute-based Encryption , 2012, IACR Cryptol. ePrint Arch..
[49] Frederik Vercauteren,et al. The Eta Pairing Revisited , 2006, IEEE Transactions on Information Theory.
[50] Matthew Green,et al. Outsourcing the Decryption of ABE Ciphertexts , 2011, USENIX Security Symposium.