Entity

Time filter

Source Type


Pang L.,Beijing University of Posts and Telecommunications | Pang L.,National Engineering Laboratory for Disaster Backup and Recovery | Sun M.-H.,Beijing University of Posts and Telecommunications | Sun M.-H.,National Engineering Laboratory for Disaster Backup and Recovery | And 5 more authors.
Journal of China Universities of Posts and Telecommunications | Year: 2012

Privacy is an important issue in electronic voting. The concept of 'full privacy' in electronic voting was firstly proposed, not only the privacy of voters is concerned, but also the candidates'. Privacy preserving electronic election architecture without any trusted third party is presented and a general technique for k-out-of-m election based on distributed ElGamal encryption and mix-match is also provided. The voters can compute the result by themselves without disclosing their will and the vote of the losing candidates. Moreover, whether the vote of winner candidate is more than a half can be verified directly. This scheme satisfies 'vote and go' pattern and achieves full privacy. The correctness and security are also analyzed. © 2012 The Journal of China Universities of Posts and Telecommunications. Source


Pang L.,Beijing University of Posts and Telecommunications | Luo S.-S.,Beijing University of Posts and Telecommunications | Geng T.,Beijing University of Posts and Telecommunications | Wang B.,Beijing University of Posts and Telecommunications | And 2 more authors.
Beijing Youdian Daxue Xuebao/Journal of Beijing University of Posts and Telecommunications | Year: 2012

To deals with the popular mechanism, group-buying auction, a secure protocol without auctioneer in semi-honest model was presented. Taking advantage of homomorphic lemma of distributed ElGamal scheme, the bidders can compute the result by themselves without disclosing own messages. The correctness and security are also analyzed. Then the protocol is extended and a basic problem in secure multiparty computation, secure zone distribution problem is proposed. At last, the application is discussed. Source


Huang M.,Beijing University of Posts and Telecommunications | Huang M.,North China University of Technology | Huang M.,Beijing Safe Code Technology Company Ltd | Zeng Y.-B.,North China University of Technology | And 4 more authors.
Beijing Youdian Daxue Xuebao/Journal of Beijing University of Posts and Telecommunications | Year: 2012

The introduction of cyclic shift delay (CSD) is used in IEEE 802.11n to distinguish different spatial streams, however it poses a challenge to synchronization. The traditional synchronization methods, which utilize the cross-correlation between the local training sequence and the received signal, will cause many spurious peaks and result in deteriorated synchronization performance. A new joint symbol synchronization and fine frequency offset estimation algorithm is proposed. It exploits the structure of IEEE 802.11n preamble and adopts a delay-correlation algorithm to eliminate the effect of CSD. The proposed algorithm has advantages in avoiding the effect of carrier frequency offset, suppressing the generation of spurious peak results and improving the detection accuracy. Source


Geng T.,Beijing University of Posts and Telecommunications | Geng T.,Beijing Safe Code Technology Company Ltd | Li H.-C.,Tangshan Teachers College | Luo S.-S.,Beijing University of Posts and Telecommunications | And 3 more authors.
Beijing Youdian Daxue Xuebao/Journal of Beijing University of Posts and Telecommunications | Year: 2012

With the aid of secure scalar product protocol, a privacy-preserving vector equivalency determination protocol is proposed. Based on privacy-preserving vector equivalency determination protocol, a privacy-preserving dynamic point distance determination protocol based on semi-honest and an n-dimension privacy-preserving dynamic point distance determination protocol are presented. The correctness and security are also analyzed. At the end, a general solution to a privacy-preserving dynamic point distance determination is discussed. Source


Song C.,Beijing University of Posts and Telecommunications | Song C.,Beijing Safe Code Technology Company Ltd | Sun Y.-Q.,Beijing University of Posts and Telecommunications | Sun Y.-Q.,Beijing Safe Code Technology Company Ltd | And 6 more authors.
Beijing Youdian Daxue Xuebao/Journal of Beijing University of Posts and Telecommunications | Year: 2011

For solving the questions of complexities, high computation-consumings and applications limited for the direct anonymous attestation (DAA), a new DAA scheme is proposed based on bilinear maps under the assumption of q strong Diffie-Hellman and decisional Diffie-Hellman so as to match the limited computational resource of trusted platform module (TPM). It is shown that the secured scheme can efficiently relieve the computation bottleneck of trusted platform and enable TPM to be used in embedded and other resource-constrained environments. Source

Discover hidden collaborations