PROBLEM TO BE SOLVED: To implement a sorting algorithm which is not based on comparison, on confidential computation.;SOLUTION: A confidential sort system is comprised of three or more confidential sort apparatuses. From a table [X] on which elements of a table X comprised of M pieces of records are confidentially distributed, a confidentially distributed table is determined which corresponds to a table obtained by sorting the records on the table X. The confidential sort system includes at least random permutation means, decoding means and sort means. The random permutation means inputs information [c] and the table [X], performs random permutation among the records through confidential computation while maintaining the correspondence between the M pieces of elements in the information [c] and the M pieces of records on the table [X], and determines randomly permutated information [cR] and table [XR]. The decoding means decodes the information [cR] and determines information cR. The sort means sorts the records on the table [XR] in an order indicated by the information cR and determines a table [XS].;COPYRIGHT: (C)2012,JPO&INPIT
展开▼
机译：解决的问题：在机密计算上实现一种不基于比较的排序算法。解决方案：机密排序系统由三个或更多机密排序设备组成。从其中秘密地分布由M条记录组成的表X的元素的表[X]，确定与通过对表X上的记录进行排序而获得的表相对应的机密分发表。机密排序系统包括：最小随机排列装置，解码装置和分类装置。随机排列装置输入信息[c]和表[X]，通过机密计算在记录之间执行随机排列，同时保持信息[c]中的M个元素与表上的M个记录之间的对应关系[X]，并确定随机排列的信息[c R ]和表[X R ]。解码装置对信息[c R ]进行解码，并确定信息c R 。排序装置按照信息c R 指示的顺序对表[X R ]上的记录进行排序，并确定表[X S ] .;版权：（C）2012，JPO＆INPIT
展开▼
