Abstract
This paper analyzes secure computation protocol’effciency in different (semi-honest and malicious and covert adversary) models. The semi-honest model is suitable for these high efficiency protocols that security requirements are not high. Secure and efficient protocols are designed in malicious model which one-sided simulatability, smartcards, cut-and-choose and black-box reduction technology are adopted, for highly sensitive data in pratice. To achieve further improvement, The security definitions are relaxed in different requirements, such as privacy, correctness and so on, to creat the special efficient protocols with different technology.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Yao, A.C.: How to generate and exchange secrets. In: Proceedings of the 27th IEEE symposium on Foundations of Computer Science, pp. 162–167 (1986)
Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: Proceedings of 19th Annual ACM Symposium on Theory of Computing, pp. 218–229 (1987)
Information on, https://users-cs.au.dk/carmit/PhDthesis.pdf
Goldreich, O.: Foundations of Cryptography: Basic Applications, vol. 2. Cambridge University Press, Cambridge (2004)
Canetti, R.: Security and Composition of Multiparty Cryptographic Protocols. Journal of Cryptology 13(1), 143–202 (2000)
Malkhi, D., Nisan, N., Pinkas, B., Sella, Y.: Fairplay – A Secure Two-Party Computation System. In: The 13th USENIX Security Symposium, pp. 287–302 (2004)
Burmester, M., Safavi-Naini, R., Taban, G.: Secure Random Key Pre-Distribution against Semi-Honest Adversaries, http://eprint.iacr.org/2008/446
Brickell, J.: Privacy-preserving graph algorithms in the semi-honest model. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol. 3788, pp. 236–252. Springer, Heidelberg (2005)
Lindell, Y.: Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation. Journal of Cryptology 16, 143–184 (2005)
Naor, M., Pinkas, B.: Efficient Oblivious Transfer Protocols. In: 12th SODA, pp. 448–457 (2001)
Freedman, M.J., Ishai, Y., Pinkas, B., Reingold, O.: Keyword Search and Oblivious Pseudorandom Functions. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 303–324. Springer, Heidelberg (2005)
Lindell, Y., Pinkas, B.: An efficient protocol for secure two-party computation in the presence of malicious adversaries. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 52–78. Springer, Heidelberg (2007)
Aumann, Y., Lindell, Y.: Security against Covert Adversaries: Efficient protocols for realistic adversaries. In: Vadhan, S.P. (ed.) TCC (2007)
Goyal, V., Mohassel, P., Smith, A.: Efficient two party and multi party computation against covert adversaries. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 289–306. Springer, Heidelberg (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, X., Sun, H., Wen, Q., Sha, S. (2011). Study on the Technology of the Secure Computation in the Different Adversarial Models. In: Jin, D., Lin, S. (eds) Advances in Computer Science, Intelligent System and Environment. Advances in Intelligent and Soft Computing, vol 104. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23777-5_77
Download citation
DOI: https://doi.org/10.1007/978-3-642-23777-5_77
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23776-8
Online ISBN: 978-3-642-23777-5
eBook Packages: EngineeringEngineering (R0)