-
Notifications
You must be signed in to change notification settings - Fork 46
-
Notifications
You must be signed in to change notification settings - Fork 46
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
关于Group by的疑问和思考 #235
Comments
Hi @Shareong,感谢认可~
|
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
首先对隐语的开源贡献表示深深的敬意,隐语丰富的文档和视频课程为社区用户提供了大量有价值的知识点和Idea!
学习完隐语关于SCQL的两节慕课,我有两个疑问:
Vertical Group By的实现原理是怎样的?
我自己思考了下,在实际的数据水平切割场景中,Group By的Key大概率是个枚举类型。大家先各自做分组和聚合,然后按Key排序,并用占位符补齐缺失Key的聚合Value,这样保证各方的数据对齐,然后再执行MPC(加法/比较),这样密态计算的开销就很小了。不知道这种思路和SCQL的实现差别有多少。
数据垂直切分场景中的分组后求最值是怎么实现的?
视频课程中详细介绍了HESum Group By,我理解它是解决SUM的问题,那如果是要计算最值呢。借鉴同态的思路,我在想揭序加密(ORE)是否能用上,有Value的一方用一个随机盐和私钥加密所有Value,然后把密文发给有分组的一方,基于密文求出最值,最后给到有Value的一方解密。
期待社区的回复~
The text was updated successfully, but these errors were encountered: