Paper Publications
Constant-rounds, linear multi-party computation for exponentiation and modulo reduction with perfect security
Release Time:2019-04-14| Hits:
Institution:计算机科学与技术学院
Title of Paper:Constant-rounds, linear multi-party computation for exponentiation and modulo reduction with perfect security
Journal:ASIACRYPT 2011 亚密会,CCF B类,LNCS, V.7073, Springer
First Author:XU Qiuliang
Document Code:lw-172916
Volume:7073
Page Number:572
Translation or Not:No
Date of Publication:2011-12
Release Time:2019-04-14
Copyright All Rights Reserved Shandong University Address: No. 27 Shanda South Road, Jinan City, Shandong Province, China: 250100
Information desk: (86) - 0531-88395114
On Duty Telephone: (86) - 0531-88364731 Construction and Maintenance: Information Work Office of Shandong University