• Publications
  • Influence
Unidirectional Chosen-Ciphertext Secure Proxy Re-Encryption
This paper presents the first unidirectional proxy re-encryption schemes with chosen-ciphertext security in the standard model (i.e., without the random oracle idealization) and considers a more realistic adversarial model where attackers may choose dishonest users' keys on their own.
Adaptive-ID Secure Revocable Identity-Based Encryption
This work describes an adaptive-ID secure revocable IBE scheme and solves a problem left open by Boldyreva et al.
Unidirectional Chosen-Ciphertext Secure Proxy Re-encryption
This paper presents the first construction of unidirectional proxy re-encryption scheme with chosen-ciphertext security in the standard model (i.e. without relying on the random oracle idealization), which solves a problem left open at CCS'07.
Designated Verifier Signatures: Anonymity and Efficient Construction from Any Bilinear Map
The notion of privacy of signer's identity is formalized which captures the strong designated verifier property investigated in their paper and a variant of the pairing-based DVS scheme introduced at Asiacrypt'03 by Steinfeld, Bull, Wang and Pieprzyk is proposed.
Lossy Encryption: Constructions from General Assumptions and Efficient Selective Opening Chosen Ciphertext Security
It is shown that statistically-hiding 2-round Oblivious Transfer implies Lossy Encryption and so do smooth hash proof systems, which shows that private information retrieval and homomorphic encryption both imply LossyEncryption, and thus Selective Opening Secure Public Key Encryption.
Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log
We provide evidence that the unforgeability of several discrete-log based signatures like Schnorr signatures cannot be equivalent to the discrete log problem in the standard model. This contradicts
Multi-designated Verifiers Signatures
This article provides a formal definition of multi-designated verifier signatures and gives a rigorous treatment of the security model for such a scheme and proposes a construction based on ring signatures, which meets the definition, but does not achieve the privacy of signer’s identity property.
Security analysis of pseudo-random number generators with input: /dev/random is not robust
This work extends the BH model to include a new security property capturing how it should accumulate the entropy of the input data into the internal state after state compromise, and proposes a simple PRNG construction that is provably robust in the authors' new and stronger adversarial model.
Randomness Complexity of Private Circuits for Multiplication
A new dedicated verification tool, based on information set decoding, is provided, which aims at finding attacks on algorithms for fixed order d at a very low computational cost.
Towards Black-Box Accountable Authority IBE with Short Ciphertexts and Private Keys
This work proposes a new construction that combines the efficiency of Goyal's first proposal with a very simple weak black-box tracing mechanism and readily extends to meet all security properties in the adaptive-ID sense, which is not known to be true for prior black- box schemes.