Pascal Paillier

Suggest Changes
Adi Shamir38
Ronald L. Rivest31
Mihir Bellare28
Phillip Rogaway28
Marc Joye27
37Marc Joye
20David Naccache
20Jean-Sébastien Coron
19David Pointcheval
17Dan Boneh

Filter Results:

  • Full text PDF available (54)

Publication Year

1997
2016
  • This year (0)
  • Last 5 years (10)
  • Last 10 years (20)

Publication Type

Co-author

Publication Venue

Key Phrases

Learn More
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
This paper investigates a novel computational problem, namely the Composite Residuosity Class Problem, and its applications to public-key cryptography. We propose a new trapdoor mechanism and derive from this technique three encryption schemes: a trapdoor permutation and two homomorphic probabilistic encryption schemes computa-tionally comparable to RSA.… (More)
Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions
We identify and fill some gaps with regard to consistency (the extent to which false positives are produced) for public-key encryption with keyword search (PEKS). We define computational and statistical relaxations of the existing notion of perfect consistency, show that the scheme of [7] is computationally consistent, and provide a new scheme that is… (More)
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 in nature well-known proofs standing in weakened proof methodologies, in particular proofs employing various formulations of the Forking Lemma in the random… (More)
Fully Collusion Secure Dynamic Broadcast Encryption with Constant-Size Ciphertexts or Decryption Keys
This paper puts forward new efficient constructions for public-key broadcast encryption that simultaneously enjoy the following properties: receivers are stateless; encryption is collusion-secure for arbitrarily large collusions of users and security is tight in the standard model; new users can join dynamically i.e. without modification of user decryption… (More)
Decryptable Searchable Encryption
As such, public-key encryption with keyword search (a.k.a PEKS or searchable encryption) does not allow the recipient to decrypt keywords i.e. encryption is not invertible. This paper introduces search-able encryption schemes which enable decryption. An additional feature is that the decryption key and the trapdoor derivation key are totally independent ,… (More)
Universal Padding Schemes for RSA
A common practice to encrypt with RSA is to first apply a padding scheme to the message and then to exponentiate the result with the public exponent; an example of this is OAEP. Similarly, the usual way of signing with RSA is to apply some padding scheme and then to exponentiate the result with the private exponent, as for example in PSS. Usually, the RSA… (More)
GEM: A Generic Chosen-Ciphertext Secure Encryption Method
This paper proposes an efficient and provably secure transform to encrypt a message with any asymmetric one-way cryptosystem. The resulting scheme achieves adaptive chosen-ciphertext security in the random oracle model. Compared to previous known generic constructions (Bellare, Rogaway, Fujisaki, Okamoto, and Pointcheval), our embedding reduces the… (More)
New Attacks on PKCS#1 v1.5 Encryption
This paper introduces two new attacks on pkcs#1 v1.5, an rsa-based encryption standard proposed by RSA Laboratories. As opposed to Bleichenbacher's attack, our attacks are chosen-plaintext only, i.e. they do not make use of a decryption oracle. The first attack applies to small public exponents and shows that a plaintext ending by sufficiently many zeroes… (More)