维普期刊资源整合服务平台（V6.5）

47篇 您的检索式：作者名="MICCIANCIO"

选中清除导出查看参考文献查看引证文献引用追踪共3页首页上一页第1页下一页末页 /3 跳转

	题名	作者	年代	出处	被引量
1	Worst-case to average-case re- ductions based on gaussian measures显示文摘	MICCIANCIO D REGEV O	2007	SIAM J Comput2007，37，1：	1
2	The hardness of the closest vector problem with preprocessing显示文摘	Micciancio D	2001	IEEE Transactions on Information Theory2001，47，3：	1
3	Worst-case to Average-case Reductions Based on Gaussian Measures 显示文摘	Micciancio D Regev O	2007	SIAM J Comput2007，37，1：	1
4	Worst-case to average-case reductions based on Gaussian measures 显示文摘	Micciancio D Regev O	2007	SIAM Journal on Computing2007，37，1：	1
5	Almost perfect lattices, the covering radius problem, and applications to Ajtai's connection factor 显示文摘	Micciancio D	2004	SIAM Journal on Computing2004，34，1：	1
6	Generalized compact knapsacks,cyclic lattices,and efficient one way functions显示文摘	MICCIANCIO D		0，，04：	1
7	Worst-case to average-case reductions based on Gaussian measures显示文摘	Micciancio D Regev O	2007	SIAM Journal on Computing2007，37，1：	1
8	Worst-ease to average-case reductions based on Gaussian measures显示文摘	MICCIANCIO D REGEV O	2007	SIAM Journal on Computing2007，37，1：	1
9	Worst-case to Average-case Reductions Based on Gaussian Measures显示文摘	Micciancio D Regev O	2007	SIAM Journal on Computing2007，37，1：	1
10	Worst-case to average case reductions based on Gaussian measures 显示文摘	Micciancio D Regev O	2007	SIAM Journal on Computing2007，37，1：	1
11	Completeness theorems for the Abadi - Rogaway logic of encrypted expressions 显示文摘	Micciancio D Warinschi B	2004	Journal of Computer Security2004，12，1：	1
12	Generalized compact knapsacks,cyclic lattices,and effcient one-way functions显示文摘	MICCIANCIO D	1997	Computational Complexity1997，16，4：	1
13	The short vector problem is NP-hard to approximate to within some constant显示文摘	Micciancio	2007	SIAM Journal on Computing2007，30，6：	1
14	The hardness of the closest vector problem with preprocessing显示文摘	Micciancio D	2001	IEEE Transactions on Information Theory2001，47，3：	1
15	Worst-case to average-case reductions based on Gaussian measures显示文摘	Micciancio D Regev O		0，，01：	1
16	Multicast security: a taxonomy and some efficiency constructions显示文摘	Ran Canetti Juan Garay Gene Itkis Daniele Micciancio Moni Naor and Benny Pinkas	1999	Infocomm1999，，：	1
17	Worst-case to Average-case Reductions Based on Gaussian Measures显示文摘	Micciancio D Regev O	2007	SIAM Journal Computer2007，37，1：	1
18	Generalized compact knapsacks, cyclic lattices, and effcient onewayfunctions显示文摘	Micciancio D	2007	Computational Complexity2007，16，4：	1
19	Completeness theorems for the Abadi-Rogaway logic of encrypted expressions显示文摘	MICCIANCIO D WARINSCHI B	2004	Journal of Computer Security2004，12，1：	1
20	Worst-case to average-case re- ductions based on gaussian measures 显示文摘	Micciancio D Regev O	2007	SIAM Jour- nal on Computing2007，37，1：	1

返回顶部每页显示：

共3页首页上一页第1页下一页末页 /3 跳转

互联网出版许可证新出网证(渝)字10号全国400电话 - 免长途话费

用户提示