标题： 安全计算随机函数 显示英文标题

标题： Secure Computation of Randomized Functions

摘要： 考虑了双用户安全计算随机函数的情况，其中仅有一个用户计算输出。 两个用户均为半诚实的；并且计算过程确保任一用户无法从自己的输入和输出推断出关于另一用户输入和输出的任何额外信息。 首先我们考虑一种情况，即隐私条件针对双方用户。 在完全安全性设置下，Kilian [STOC 2000] 对可安全计算的随机函数进行了表征，并为这些函数提供了速率最优协议。 我们证明了相同的表征在渐进安全性设置下也成立，并给出了速率最优协议。 在另一种情况下，即隐私条件仅针对未计算函数的用户，我们也提供了速率最优协议。 对于两种情况下的完全安全性，我们的结果以不同图的色熵表示。 在渐进安全性设置下，我们在两种情况下均得到了单字母形式的速率表达式。 显示英文摘要

摘要： Two user secure computation of randomized functions is considered, where only one user computes the output. Both the users are semi-honest; and computation is such that no user learns any additional information about the other user's input and output other than what cannot be inferred from its own input and output. First we consider a scenario, where privacy conditions are against both the users. In perfect security setting Kilian [STOC 2000] gave a characterization of securely computable randomized functions, and we provide rate-optimal protocols for such functions. We prove that the same characterization holds in asymptotic security setting as well and give a rate-optimal protocol. In another scenario, where privacy condition is only against the user who is not computing the function, we provide rate-optimal protocols. For perfect security in both the scenarios, our results are in terms of chromatic entropies of different graphs. In asymptotic security setting, we get single-letter expressions of rates in both the scenarios.