A secure multi-party computation solution to intersection problems of sets and rectangles*

Author： Shundong Li Yigi Dai Daoshun Wang Ping Luo

ISSN： 1002-0071

Source： Progress in Natural Science, Vol.16, Iss.5, 2006-05, pp. : 538-545

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Secure multi-party computation solution to Yao's millionaires' problem based on set-inclusion

By Shundong Li Yiqi Dai Qiyou You

Progress in Natural Science, Vol. 15, Iss. 9, 2005-09 ,pp. : 851-856

Taylor & Francis Ltd

Access to resources Recommend Favorite

Searching for joint gains in multi-party negotiations

By Ehtamo H. Kettunen E. Hamalainen R.P.

European Journal of Operational Research, Vol. 130, Iss. 1, 2001-04 ,pp. : 54-69

Elsevier

Access to resources Recommend Favorite

Constraint proposal method for computing Pareto solutions in multi-party negotiations

By Heiskanen P. Ehtamo H. Hamalainen R.P.

European Journal of Operational Research, Vol. 133, Iss. 1, 2001-08 ,pp. : 44-61

Elsevier

Access to resources Recommend Favorite

The d Alpern multi-tower theorem for rectangles: a tiling approach

By Sahİn Ayse

Dynamical Systems: An International Journal, Vol. 24, Iss. 4, 2009-12 ,pp. : 485-499

Taylor & Francis Ltd

Access to resources Recommend Favorite

Greedy sets and related problems

By Girlich E. Kovalev M.M. Vasilkov D.M.

European Journal of Operational Research, Vol. 101, Iss. 1, 1997-08 ,pp. : 74-80

Elsevier

Access to resources Recommend Favorite