Secure Non-interactive Simulation: Feasibility and Rate
Secure Non-interactive Simulation: Feasibility and Rate
复制标题
安全的非交互式模拟:可行性和速率
DOI:
10.1007/978-3-031-07082-2_27
复制
发表时间:
2022
期刊:
影响因子:
--
通讯作者:
Nguyen, Hai H.
中科院分区:
文献类型:
--
作者:
Khorasgani, Hamidreza Amini;Maji, Hemanta K.;Nguyen, Hai H.
A natural solution to increase the efficiency of secure computation will be to non-interactively and securely transform diverse inexpensive-to-generate correlated randomness, like, joint samples from noise sources, into correlations useful for secure computation protocols. Motivated by this general application for secure computation, our work introduces the notion ofsecure non-interactive simulation(SNIS). Parties receive samples of correlated randomness, and they, without any interaction, securely convert them into samples from another correlated randomness.Our work presents a simulation-based security definition for SNIS and initiates the study of the feasibility and efficiency of SNIS. We also study SNIS among fundamental correlated randomnesses like random samples from the binary symmetric and binary erasure channels, represented byand, respectively. We show the impossibility of interconversion betweenandsamples.Next, we prove that a SNIS of asample (awith noise characteristic) fromis feasible if and only if, for some. In this context, we prove that all SNIS constructions must be linear. Furthermore, if, then the rate of simulating multiple independentsamples is at most 1/k, which is also achievable using (block) linear constructions.Finally, we show that a SNIS of asample fromsamples is feasible if and only if, for some. Interestingly, there are linear as well as non-linear SNIS constructions. When, we prove that the rate of aperfectly secureSNIS is at most 1/k, which is achievable using linear and non-linear constructions.Our technical approach algebraizes the definition of SNIS and proceeds via Fourier analysis. Our work develops general analysis methodologies for Boolean functions, explicitly incorporating cryptographic security constraints. Our work also proves strong forms ofstatistical-to-perfect securitytransformations: one can error-correct a statistically secure SNIS to make it perfectly secure. We show a connection of our research withhomogeneous Boolean functionsanddistance-invariant codes, which may be of independent interest.
登录
查看更多内容
DOI:
10.1137/1.9781611975031.174
发表时间:
2017
期刊:
ArXiv
影响因子:
--
作者:
Anindya De;Elchanan Mossel;Joe Neeman
通讯作者:
Joe Neeman
DOI:
10.1109/focs.2012.68
发表时间:
2012
期刊:
2012 IEEE 53rd Annual Symposium on Foundations of Computer Science
影响因子:
--
作者:
Iordanis Kerenidis;Sophie Laplante;Virginie Lerays;J. Roland;David Xiao
通讯作者:
David Xiao
DOI:
10.1016/s0166-218x(96)00076-5
发表时间:
1997
期刊:
Discret. Appl. Math.
影响因子:
--
作者:
B. Bollobás;I. Leader
通讯作者:
I. Leader
影响因子:
3
作者:
Shweta Agrawal;Yuval Ishai;E. Kushilevitz;Varun Narayanan;M. Prabhakaran;V. Prabhakaran;Alon Rosen
通讯作者:
Alon Rosen
DOI:
10.1109/itw.2014.6970787
发表时间:
2014
期刊:
2014 IEEE Information Theory Workshop (ITW 2014)
影响因子:
--
作者:
K. Sankeerth Rao;V. Prabhakaran
通讯作者:
V. Prabhakaran