English  |  正體中文  |  简体中文  |  Items with full text/Total items : 54367/62174 (87%)
Visitors : 14509084      Online Users : 48
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTHU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    National Tsing Hua University Institutional Repository > 歷任校長 > 陳文村 (2006-2010)  > 會議論文 >  Anonymous Multi-Receiver Certificate-Based Encryption

    Please use this identifier to cite or link to this item: http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/81583

    Title: Anonymous Multi-Receiver Certificate-Based Encryption
    Authors: Chun-I Fan;Pei-Jen Tsai;Jheng-Jia Huang;W. T. Chen
    教師: 陳文村
    Date: 2013
    Publisher: Institute of Electrical and Electronics Engineers
    Relation: Proceedings of International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC 2013), Institute of Electrical and Electronics Engineers, Beijing, China, 10-12 October 2013
    Keywords: Anonymity
    Bilinear Pairing
    Certificate-Based Encryption
    Key Escrow Freeness
    Multi-Receiver Encryption
    Abstract: In a multi-receiver encryption environment, a sender can randomly choose a set of authorized receivers while distributing messages to them efficiently and securely. Recently, more and more researchers concern the privacy of receivers. They mentioned that an authorized receiver does not want other entities, except the service provider, to be able to derive her/his identity in many applications such as pay-TV. However, most of these protocols either provide no formal security proofs or are inefficient owing to high computation cost. In this paper, we construct a provably secure and efficient anonymous multi-receiver certificated-based encryption scheme, PMCE, which avoids the key escrow problem while preserving the implicit certification of identity-based setting. The proposed PMCE gets rid of pairing computation to encrypt a message and only needs one pairing computation to decrypt the cipher text. Finally, we define the security models and offer formal proofs to all properties including receiver
    Relation Link: http://www.ieee.org/index.html
    URI: http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/81583
    Appears in Collections:[陳文村 (2006-2010) ] 會議論文
    [資訊工程學系] 會議論文

    Files in This Item:

    File Description SizeFormat


    SFX Query


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback