Presentation 2013/2/28
Improved Algorithms for Computing Relational Algebra Operators for Secure Function Evaluation
Koki HAMADA, Dai IKARASHI, Koji CHIDA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) We propose algorithms that efficiently compute relational algebra operations for secure function evaluat ion. Relational algebra is a set of operations for manipulating relational databases. It is shown that all operations are derived from five primitive operators: the selection, the projection, the cross product, the set union, and the set difference. Algorithms that realize these primitive operators and additional important operators the set intersection, the join, and the division are proposed. We propose algorithms that conduct the set difference, the set union, the set intersection, and division operators in O(log(m+n)) rounds and O(m+n)log(m+n)) communications where m and n represent the sizes of the input tables.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Secure function evaluation / relational algebra
Paper # LOTS2012-82
Date of Issue

Conference Information
Committee LOIS
Conference Date 2013/2/28(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Life Intelligence and Office Information Systems (LOIS)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Improved Algorithms for Computing Relational Algebra Operators for Secure Function Evaluation
Sub Title (in English)
Keyword(1) Secure function evaluation
Keyword(2) relational algebra
1st Author's Name Koki HAMADA
1st Author's Affiliation NTT Secure Platform Laboratories()
2nd Author's Name Dai IKARASHI
2nd Author's Affiliation NTT Secure Platform Laboratories
3rd Author's Name Koji CHIDA
3rd Author's Affiliation NTT Secure Platform Laboratories
Date 2013/2/28
Paper # LOTS2012-82
Volume (vol) vol.112
Number (no) 466
Page pp.pp.-
#Pages 6
Date of Issue