Skip to main content

previous disabled Page of 8
and
  1. No Access

    Chapter and Conference Paper

    Provably Secure Proactive Secret Sharing Without the Adjacent Assumption

    In secret sharing (SS), the secret is shared among a number of parties so that only a quorum of these parties can recover the secret, but a smaller set of parties cannot learn any information about the secret....

    Zhe **a, Bo Yang, Yanwei Zhou, Mingwu Zhang, Hua Shen, Yi Mu in Provable Security (2019)

  2. No Access

    Chapter and Conference Paper

    Efficient Traceable Oblivious Transfer and Its Applications

    Oblivious transfer (OT) has been applied widely in privacy-sensitive systems such as on-line transactions and electronic commerce to protect users’ private information. Traceability is an interesting feature o...

    Weiwei Liu, Yinghui Zhang, Yi Mu in Information Security Practice and Experien… (2018)

  3. No Access

    Chapter and Conference Paper

    Efficient Attribute-Based Encryption with Blackbox Traceability

    Traitor tracing scheme can be used to identify a decryption key is illegally used in public-key encryption. In CCS’13, Liu et al. proposed an attribute-based traitor tracing (ABTT) scheme with blackbox traceab...

    Shengmin Xu, Guomin Yang, Yi Mu, **meng Liu in Provable Security (2018)

  4. No Access

    Chapter and Conference Paper

    An Efficient and Provably Secure Private Polynomial Evaluation Scheme

    Private Polynomial Evaluation (PPE) allows the service provider to outsource the computation of a polynomial to some third party (e.g. the Cloud) in a verifiable way. And meanwhile, the polynomial remains hidd...

    Zhe **a, Bo Yang, Mingwu Zhang, Yi Mu in Information Security Practice and Experience (2018)

  5. No Access

    Chapter and Conference Paper

    Group-Based Source-Destination Verifiable Encryption with Blacklist Checking

    We consider user conditional privacy preservation in the context of public key encryption. Unlike the full privacy preservation, our conditional one ensures that the message sender’s as well as the intended re...

    Zhongyuan Yao, Yi Mu, Guomin Yang in Information Security Practice and Experience (2017)

  6. No Access

    Chapter and Conference Paper

    Achieving IND-CCA Security for Functional Encryption for Inner Products

    Functional encryption allows the authorised parties to reveal partial information of the plaintext hidden in a ciphertext while in conventional encryption decryption is all-or-nothing. Focusing on the function...

    Shiwei Zhang, Yi Mu, Guomin Yang in Information Security and Cryptology (2017)

  7. No Access

    Chapter and Conference Paper

    ID-Based Encryption with Equality Test Against Insider Attack

    Testing if two ciphertexts contain the same plaintext is an interesting cryptographic primitive. It is usually referred to as equality test of encrypted data or equality test. One of attractive applications of...

    Tong Wu, Sha Ma, Yi Mu, Shengke Zeng in Information Security and Privacy (2017)

  8. No Access

    Chapter and Conference Paper

    Privacy-Preserving k-time Authenticated Secret Handshakes

    Secret handshake allows a group of authorized users to establish a shared secret key and at the same time authenticate each other anonymously. A straightforward approach to design an unlinkable secret handshak...

    Yangguang Tian, Shiwei Zhang, Guomin Yang, Yi Mu in Information Security and Privacy (2017)

  9. No Access

    Chapter and Conference Paper

    Provably Secure Homomorphic Signcryption

    Signcryption has shown many useful applications, in particular for the environment where the computation and communication resources are constrained, for instance, for applications on lightweight devices. Howe...

    Fatemeh Rezaeibagha, Yi Mu, Shiwei Zhang, **aofen Wang in Provable Security (2017)

  10. No Access

    Chapter and Conference Paper

    Hierarchical Functional Encryption for Linear Transformations

    In contrast to the conventional all-or-nothing encryption, functional encryption (FE) allows partial revelation of encrypted information based on the keys associated with different functionalities. Extending F...

    Shiwei Zhang, Yi Mu, Guomin Yang, **aofen Wang in Information Security and Privacy (2017)

  11. Chapter and Conference Paper

    Optimal Security Reductions for Unique Signatures: Bypassing Impossibilities with a Counterexample

    Optimal security reductions for unique signatures (Coron, Eurocrypt 2002) and their generalization, i.e., efficiently re-randomizable signatures (Hofheinz et al. PKC 2012 & Bader et al. Eurocrypt 2016) have been ...

    Fuchun Guo, Rongmao Chen, Willy Susilo in Advances in Cryptology – CRYPTO 2017 (2017)

  12. No Access

    Chapter and Conference Paper

    Mergeable and Revocable Identity-Based Encryption

    Identity-based encryption (IBE) has been extensively studied and widely used in various applications since Boneh and Franklin proposed the first practical scheme based on pairing. In that seminal work, it has ...

    Shengmin Xu, Guomin Yang, Yi Mu, Willy Susilo in Information Security and Privacy (2017)

  13. No Access

    Chapter and Conference Paper

    Deniable Ring Authentication Based on Projective Hash Functions

    Deniable authentication allows the participants to deny an authentication process as there is no any evidence that it ever took place. It is quite suitable for the privacy-preserving scenario. Combining with t...

    Shengke Zeng, Yi Mu, Guomin Yang, Mingxing He in Provable Security (2017)

  14. No Access

    Chapter and Conference Paper

    One-Round Strong Oblivious Signature-Based Envelope

    Oblivious Signature-Based Envelope (OSBE) has been widely employed for anonymity-orient and privacy-preserving applications. The conventional OSBE execution relies on a secure communication channel to protect ...

    Rongmao Chen, Yi Mu, Willy Susilo, Guomin Yang in Information Security and Privacy (2016)

  15. No Access

    Chapter and Conference Paper

    One-Round Attribute-Based Key Exchange in the Multi-party Setting

    Attribute-based authenticated key exchange (AB-AKE) is a useful primitive that allows a group of users to establish a shared secret key and at the same time enables fine-grained access control. A straightforwa...

    Yangguang Tian, Guomin Yang, Yi Mu, Kaitai Liang, Yong Yu in Provable Security (2016)

  16. No Access

    Chapter and Conference Paper

    Strongly Leakage-Resilient Authenticated Key Exchange

    Authenticated Key Exchange (AKE) protocols have been widely deployed in many real-world applications for securing communication channels. In this paper, we make the following contributions. First, we revisit t...

    Rongmao Chen, Yi Mu, Guomin Yang, Willy Susilo in Topics in Cryptology - CT-RSA 2016 (2016)

  17. Chapter and Conference Paper

    Iterated Random Oracle: A Universal Approach for Finding Loss in Security Reduction

    The indistinguishability security of a public-key cryptosystem can be reduced to a computational hard assumption in the random oracle model, where the solution to a computational hard problem is hidden in one ...

    Fuchun Guo, Willy Susilo, Yi Mu, Rongmao Chen in Advances in Cryptology – ASIACRYPT 2016 (2016)

  18. No Access

    Chapter and Conference Paper

    Public Key Encryption with Authorized Keyword Search

    Public key encryption with keyword search (PEKS) provides an elegant mechanism for a user to identify the specific encrypted data. PEKS protects data against disclosure while making it searchable. In this pape...

    Peng Jiang, Yi Mu, Fuchun Guo, Qiaoyan Wen in Information Security and Privacy (2016)

  19. No Access

    Chapter and Conference Paper

    A Privacy Preserving Source Verifiable Encryption Scheme

    It is critical to guarantee message confidentiality and user privacy in communication networks, especially for group communications. We find previous works seldom consider these aspects at the same time and so...

    Zhongyuan Yao, Yi Mu, Guomin Yang in Information Security Practice and Experience (2016)

  20. No Access

    Chapter and Conference Paper

    Ciphertext-Policy Attribute-Based Encryption with Key-Delegation Abuse Resistance

    Attribute-based encryption (ABE) is a promising cryptographic primitive that allows one-to-many encryption. In such a system, users’ private keys are linked to their access rights. We note that if a user can g...

    Yinhao Jiang, Willy Susilo, Yi Mu, Fuchun Guo in Information Security and Privacy (2016)

previous disabled Page of 8