• Publications
  • Influence
Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption
We present two fully secure functional encryption schemes for two cases of functional encryption, namely attribute-based encryption (ABE) and predicate encryption (PE) for inner-product predicates. Expand
  • 1,141
  • 97
  • PDF
A Practical Secret Voting Scheme for Large Scale Elections
This paper proposes a practical secret voting scheme for large scale elections. Expand
  • 923
  • 71
  • PDF
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. Expand
  • 463
  • 59
  • PDF
Reducing elliptic curve logarithms to logarithms in a finite field
We demonstrate the reduction of the elliptic curve logarithm problem to the logarithsm problem in the multiplicative group of an extension of the underlying finite field. Expand
  • 969
  • 52
  • PDF
Provably Secure and Practical Identification Schemes and Corresponding Signature Schemes
  • T. Okamoto
  • Mathematics, Computer Science
  • 16 August 1992
This paper presents a three-move interactive identification scheme and proves it to be as secure as the discrete logarithm problem. Expand
  • 606
  • 50
  • PDF
A New Public-Key Cryptosystem as Secure as Factoring
This paper proposes a novel public-key cryptosystem, which is practical, provably secure and has some other interesting properties as follows: 1. Expand
  • 691
  • 45
Secure Integration of Asymmetric and Symmetric Encryption Schemes
This paper presents a generic conversion from weak asymmetric and symmetric encryption schemes to an asymmetric encryption scheme that is chosen-ciphertext secure in the random oracle model. Expand
  • 598
  • 43
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 one against adaptive chosen-ciphertext attacks (active adversaries) in the random oracle model. Expand
  • 327
  • 41
Hierarchical Predicate Encryption for Inner-Products
This paper presents a hierarchical predicate encryption scheme for inner-product predicates that is secure (selectively attribute-hiding) in the standard model under new assumptions. Expand
  • 264
  • 40
REACT: Rapid Enhanced-Security Asymmetric Cryptosystem Transform
This paper presents REACT, a new conversion which applies to any weakly secure cryptosystem, in the random oracle model: it is optimal from both the computational and the security points of view. Expand
  • 256
  • 36
  • PDF