• Publications
  • Influence
Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption
We present two fully secure functional encryption schemes: a fully secure attribute-based encryption (ABE) scheme and a fully secure (attribute-hiding) predicate encryption (PE) scheme for
A Practical Secret Voting Scheme for Large Scale Elections
TLDR
This paper proposes a practical secret voting scheme for large scale elections that ensures the privacy of the voters even if both the administrator and the counter conspire, and realizes voting fairness, i.e., no one can know even intermediate result of the voting.
Fully Secure Functional Encryption with General Relations from the Decisional Linear Assumption
This paper presents a fully secure functional encryption scheme for a wide class of relations, that are specified by nonmonotone access structures combined with inner-product relations. The security
Reducing elliptic curve logarithms to logarithms in a finite field
TLDR
The main result of the paper is to demonstrate the reduction of the elliptic curve logarithm problem to the logariths problem in the multiplicative group of an extension of the underlying finite field, thus providing a probabilistic subexponential time algorithm for the former problem.
Secure Integration of Asymmetric and Symmetric Encryption Schemes
TLDR
This conversion is the first generic transformation from an arbitrary one-way asymmetricryption scheme to a chosen-ciphertext secure asymmetric encryption scheme in the random oracle model.
Provably Secure and Practical Identification Schemes and Corresponding Signature Schemes
  • T. Okamoto
  • Computer Science, Mathematics
    CRYPTO
  • 16 August 1992
TLDR
A variant is proposed which is proven to be as secuie as the difficulty of solving both the discrete logarithm problem and the specific factoring problem simultaneously simultaneously and some other variants such as an identity-based variant and an elliptic curve variant are also proposed.
A New Public-Key Cryptosystem as Secure as Factoring
TLDR
This paper proposes a novel public-key cryptosystem, which is practical, provably secure and has some other interesting properties as follows: It can be proven to be as secure as the intractability of factoring n = p2q (in the sense of the security of the whole plaintext) against passive adversaries.
Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations
This paper proposes a bit commitment scheme, BC(·), and efficient statistical zero knowledge (in short, SZK) protocols in which, for any given multi-variable polynomial f(X 1,..,X t) and any given
Hierarchical Predicate Encryption for Inner-Products
TLDR
To the best of the knowledge, this is the first HPE scheme for inner-product predicates that is secure in the standard model and based on a new approach on bilinear pairings, which is extended from bil inear pairing groups over linear spaces.
How to Enhance the Security of Public-Key Encryption at Minimum Cost
This paper presents a simple and efficient conversion from a semantically secure public-key encryption scheme against passive adversaries to a non-malleable (or semantically secure) public-key
...
...