Остановите войну!
for scientists:
default search action
Kun Peng
Publications
- 2013
- [c61]Kun Peng, Matt Henricksen:
Multiplicative Homomorphic E-Auction with Formally Provable Security. WISTP 2013: 1-17 - 2012
- [c60]Kun Peng, Matt Henricksen:
How to Fix Two RSA-Based PVSS Schemes - Exploration and Solution. ACISP 2012: 223-234 - 2011
- [j9]Kun Peng, Ed Dawson, Feng Bao:
Modification and optimisation of a shuffling scheme: stronger security, formal analysis and higher efficiency. Int. J. Inf. Sec. 10(1): 33-47 (2011) - [c55]Kun Peng, Feng Bao:
Analysing a Batch Range Proof to Address a Security Concern. CSE 2011: 68-72 - 2010
- [c47]Kun Peng, Feng Bao:
Achieving High Efficiency in Membership Proof without Compromising or Weakening any Security Property. CIT 2010: 1044-1049 - [c46]Kun Peng, Feng Bao:
Batch Range Proof for Practical Small Ranges. AFRICACRYPT 2010: 114-130 - [c44]Kun Peng, Feng Bao:
A Secure RFID Ticket System for Public Transport. DBSec 2010: 350-357 - [c41]Kun Peng, Feng Bao:
Efficient Multiplicative Homomorphic E-Voting. ISC 2010: 381-393 - [c40]Kun Peng, Feng Bao:
Efficient Proof of Validity of Votes in Homomorphic E-Voting. NSS 2010: 17-23 - [c39]Kun Peng, Feng Bao:
Formal and Precise Analysis of Soundness of Several Shuffling Schemes. ProvSec 2010: 133-143 - [c38]Kun Peng, Feng Bao:
Vulnerability of a Non-membership Proof Scheme. SECRYPT 2010: 419-422 - [c37]Kun Peng, Feng Bao:
A Shuffling Scheme with Strict and Strong Security. SECURWARE 2010: 201-206 - [c36]Kun Peng, Feng Bao:
An Efficient Range Proof Scheme. SocialCom/PASSAT 2010: 826-833 - [c35]Kun Peng, Feng Bao:
Efficiency Improvement of Homomorphic E-Auction. TrustBus 2010: 238-249 - 2009
- [c34]Kun Peng, Feng Bao:
Practicalization of a Range Test and Its Application to E-Auction. EuroPKI 2009: 179-194 - [c31]Kun Peng, Feng Bao:
A Design of Secure Preferential E-Voting. VoteID 2009: 141-156 - [c30]Kun Peng, Feng Bao:
Efficient Publicly Verifiable Secret Sharing with Correctness, Soundness and ZK Privacy. WISA 2009: 118-132 - 2008
- [j4]Kun Peng, Feng Bao, Ed Dawson:
Correct, Private, Flexible and Efficient Range Test. J. Res. Pract. Inf. Technol. 40(4): 275-289 (2008) - [c29]Kun Peng, Feng Bao:
Batch ZK Proof and Verification of OR Logic. Inscrypt 2008: 141-156 - [c28]Kun Peng, Feng Bao:
Correction, Optimisation and Secure and Efficient Application of PBD Shuffling. Inscrypt 2008: 425-437 - [c27]Kun Peng, Feng Bao:
Efficient Vote Validity Check in Homomorphic Electronic Voting. ICISC 2008: 202-217 - 2007
- [j3]Kun Peng, Colin Boyd, Ed Dawson:
Batch zero-knowledge proof and verification and its applications. ACM Trans. Inf. Syst. Secur. 10(2): 6 (2007) - [c26]Kun Peng, Ed Dawson:
A Range Test Secure in the Active Adversary Model. ACSW 2007: 159-162 - [c24]Kun Peng, Ed Dawson:
Efficient Bid Validity Check in ElGamal-Based Sealed-Bid E-Auction. ISPEC 2007: 209-224 - 2006
- [j2]Kun Peng, Colin Boyd, Ed Dawson:
Batch verification of validity of bids in homomorphic e-auction. Comput. Commun. 29(15): 2798-2805 (2006) - [c23]Kun Peng, Colin Boyd, Ed Dawson, Eiji Okamoto:
A Novel Range Test. ACISP 2006: 247-258 - [c22]Kun Peng, Juan Manuel González Nieto, Yvo Desmedt, Ed Dawson:
Klein Bottle Routing: An Alternative to Onion Routing and Mix Network. ICISC 2006: 296-309 - [c21]Kun Peng, Colin Boyd, Ed Dawson:
Sealed-Bid Micro Auctions. SEC 2006: 246-257 - 2005
- [c19]Ming Yao, Kun Peng, Ed Dawson:
Using "Fair Forfeit" to Prevent Truncation Attacks on Mobile Agents. ACISP 2005: 158-169 - [c17]Kun Peng, Ed Dawson, Juanma González Nieto, Eiji Okamoto, Javier López:
A Novel Method to Maintain Privacy in Mobile Agent Applications. CANS 2005: 247-260 - [c16]Kun Peng, Colin Boyd, Ed Dawson:
Simple and Efficient Shuffling with Provable Correctness and ZK Privacy. CRYPTO 2005: 188-204 - [c14]Kun Peng, Colin Boyd, Ed Dawson, Byoungcheon Lee:
Ciphertext Comparison, a New Solution to the Millionaire Problem. ICICS 2005: 84-96 - [c13]Kun Peng, Colin Boyd, Ed Dawson:
A Multiplicative Homomorphic Sealed-Bid Auction Based on Goldwasser-Micali Encryption. ISC 2005: 374-388 - [c12]Kun Peng, Colin Boyd, Ed Dawson:
Optimization of Electronic First-Bid Sealed-Bid Auction Based on Homomorphic Secret Sharing. Mycrypt 2005: 84-98 - [i1]Kun Peng, Colin Boyd, Ed Dawson:
Batch Verification of Validity of Bids in Homomorphic E-auction. IACR Cryptol. ePrint Arch. 2005: 346 (2005) - 2004
- [c11]Riza Aditya, Kun Peng, Colin Boyd, Ed Dawson, Byoungcheon Lee:
Batch Verification for Equality of Discrete Logarithms and Threshold Decryptions. ACNS 2004: 494-508 - [c10]Kun Peng, Riza Aditya, Colin Boyd, Ed Dawson, Byoungcheon Lee:
A Secure and Efficient Mix-Network using Extended Binary Mixing Gate. Cryptographic Algorithms and their Uses 2004: 57-71 - [c9]Ming Yao, Kun Peng, Matthew Henricksen, Ernest Foo, Ed Dawson:
Using Recoverable Key Commitment to Defend Against Truncation Attacks in Mobile Agents. EC-Web 2004: 164-173 - [c8]Kun Peng, Colin Boyd, Ed Dawson, Byoungcheon Lee:
An Efficient and Verifiable Solution to the Millionaire Problem. ICISC 2004: 51-66 - [c7]Kun Peng, Riza Aditya, Colin Boyd, Ed Dawson, Byoungcheon Lee:
Multiplicative Homomorphic E-Voting. INDOCRYPT 2004: 61-72 - [c6]Kun Peng, Colin Boyd, Ed Dawson, Kapalee Viswanathan:
A Correct, Private, and Efficient Mix Network. Public Key Cryptography 2004: 439-454 - 2003
- [c5]Kun Peng, Colin Boyd, Ed Dawson, Kapali Viswanathan:
Five Sealed-bid Auction Models. ACSW 2003: 77-86 - [c4]Kun Peng, Colin Boyd, Ed Dawson, Kapalee Viswanathan:
Efficient Implementation of Relative Bid Privacy in Sealed-Bid Auction. WISA 2003: 244-256 - [c3]Ming Yao, Ernest Foo, Kun Peng, Ed Dawson:
An Improved Forward Integrity Protocol for Mobile Agents. WISA 2003: 272-285 - 2002
- [c2]Kun Peng, Colin Boyd, Ed Dawson, Kapali Viswanathan:
Robust, Privacy Protecting and Publicly Verifiable Sealed-Bid Auction. ICICS 2002: 147-159 - [c1]Kun Peng, Colin Boyd, Ed Dawson, Kapali Viswanathan:
Non-interactive Auction Schemewith Strong Privacy. ICISC 2002: 407-420
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-02-16 17:26 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint