Proxy Re-encryption Scheme based on New Multivariate Quadratic Assumptions

  title={Proxy Re-encryption Scheme based on New Multivariate Quadratic Assumptions},
  author={Shuaishuai Zhu and Xiaoyuan Yang},
  journal={J. Comput.},
In PKC 2012, a public key encryption based on new multivariate quadratic assumptions is proposed. The compactness and security of the algorithm illumined us in applying it in proxy re-encryption scheme. In this paper, a novel unidirectional PRE scheme (NMQ-PRE) is constructed based on new multivariate quadratic assumptions. The new scheme is a formal PRE scheme and compact in cryptographic protocols. By applying the nature property of multivariate quadratic assumptions, NMQ-PRE is proved chosen… 
1 Citations

General Construction of Chameleon All-But-One Trapdoor Functions and Their Applications

This paper formally generalizes the construction of chameleon all-but-one trapdoor function (ABO- TDF) and presents a concrete construction of ABO-TDFs, which was first introduced by Peikert and Waters (1).



Chosen-Ciphertext Secure Proxy Re-encryption without Pairings

A new proxy re-encryption scheme without resort to bilinear pairings is proposed, and the chosen-ciphertext security of the proposed scheme is proved in the random oracle model.

Efficient Unidirectional Proxy Re-Encryption

This paper proposes an efficient unidirectional PRE scheme, which the re-encryption key only enables delegation in one direction but not the opposite, and gains high efficiency and CCA-security using the “token-controlled encryption” technique.

CCA-Secure Proxy Re-Encryption without Pairings

  • Jun ShaoZ. Cao
  • Computer Science, Mathematics
    IACR Cryptol. ePrint Arch.
  • 2009
This paper proposes a proxy re-encryption scheme without pairings, in which the proxy can only transform the ciphertext in one direction, and is the first unidirectional PRE scheme with CCA security and collusion-resistance.

Public-Key Cryptography from New Multivariate Quadratic Assumptions

This work constructs the first public-key encryption scheme that is provably secure under the MQ assumption, and is efficient in the sense that it only needs a ciphertext length L +poly(k ) to encrypt a message M ∈{0, 1}L for any un-prespecified polynomial L, where k is the security parameter.

Divertible Protocols and Atomic Proxy Cryptography

A definition of protocol divertibility is given that applies to arbitrary 2-party protocols and is compatible with Okamoto and Ohta's definition in the case of interactive zero-knowledge proofs and generalizes to cover several protocols not normally associated with divertibility.

Towards a secure and interoperable DRM architecture

This paper introduces an intermediate module called the Domain Interoperability Manager (DIM) to efficiently deal with the problem of content and license translation across different DRM regimes and formalizes the adversary model and defines security of an interoperable DRM system with respect to this adversary.

Trapdoor one-way permutations and multivariate polynominals

This article presents a new algorithm, called D*, which is based on properties of multivariate polynomials on finite fields, and has similar characteristics to T. Matsumoto and H. Imai's schemes.

Certified mailing lists

A novel Certified Mailing-list Protocol (CMLP) that provides fair delivery, confidentiality, non-repudiation of origin and receipt, and authentication and integrity is proposed.

Computers and Intractability: A Guide to the Theory of NP-Completeness

The experiences, understandings, and beliefs that guide the professional practices of teacher educators are explored, and the book paints a picture of a profession that offers huge rewards, alongside challenges and frustrations.

Chosen-Siphertext Cecure Proxy Re-Encryption

  • ACM Conference on Computer and Communications Security,
  • 2007