( en | de | ru )

 

Disambiguation of "Peng, Kun"

Author of the publication

copydeleteadd this publication to your clipboard
A Secure and Efficient Proof of Integer in an Interval Range.

. IMACC, volume 7089 of Lecture Notes in Computer Science, page 97-111. Springer, (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Kun Tao

Kun Fang

Kun Ma

Kun Sun

Kun Wang

 

Other publications of authors with the same name

A Robust and Efficient Algorithm for Eye Detection on Gray Intensity Face., , , and . ICAPR (2), volume 3687 of Lecture Notes in Computer Science, page 302-308. Springer, (2005)A Secure and Efficient Mix-Network using Extended Binary Mixing Gate., , , , and . Cryptographic Algorithms and their Uses, page 57-71. Queensland University of Technology, (2004)Batch Verification of Validity of Bids in Homomorphic E-auction., , and . IACR Cryptology ePrint Archive, (2005)A Range Test Secure in the Active Adversary Model., and . ACSW, volume 68 of CRPIT, page 159-162. Australian Computer Society, (2007)Studying a Range Proof Technique - Exception and Optimisation., and . AFRICACRYPT, volume 7918 of Lecture Notes in Computer Science, page 328-341. Springer, (2013)Secure Multiparty Computation of DNF.. ICICS, volume 4861 of Lecture Notes in Computer Science, page 254-268. Springer, (2007)Ciphertext Comparison, a New Solution to the Millionaire Problem., , , and . ICICS, volume 3783 of Lecture Notes in Computer Science, page 84-96. Springer, (2005)Batch zero-knowledge proof and verification and its applications., , and . ACM Trans. Inf. Syst. Secur., 10 (2): 6 (2007)Ultra-Low-Power CMOS Temperature Sensor for UHF RFID Systems., , and . ASICON, page 1-4. IEEE, (2019)Verifiable Secret Sharing with Comprehensive and Efficient Public Verification.. DBSec, volume 6818 of Lecture Notes in Computer Science, page 217-230. Springer, (2011)