David Pointcheval
Artificial Intelligence · 1998–2016
A researcher in the Science corpus: 17 papers; trusts 44 researchers and is trusted by 69 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 97 citations into it; #4,170 of 36,961 by trust here, #6,098 by citations
- Information Systems — 41 citations into it; #1,158 of 9,233 by trust here, #2,577 by citations
- Computer Networks and Communications — 32 citations into it; #998 of 9,996 by trust here, #1,793 by citations
- Computational Theory and Mathematics — 28 citations into it; #1,568 of 12,489 by trust here, #2,355 by citations
- Computer Vision and Pattern Recognition — 23 citations into it
- Algorithms & Complexity — 9 citations into it
- Privacy & Security — 9 citations into it
- Political Science and International Relations — 8 citations into it
Whom David Pointcheval trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Mihir Bellare
- Claus-Peter Schnorr
- Shafi Goldwasser
- Dan Boneh
- Phillip Rogaway
- Silvio Micali
- R. Rivest
- Anna Lysyanskaya
- Jan Camenisch
- Adi Shamir
Who trusts David Pointcheval overall
- Dan Boneh
- Mihir Bellare
- Nai-Wei Lo
- Jonathan Katz
- Xuefeng Liu
- Victor Shoup
- Jia-Lun Tsai
- Brian A. LaMacchia
- M. Yung
- Joonsang Baek
Papers from David Pointcheval's perspective
Ordered by how strongly the researchers David Pointcheval trusts endorse each paper. Same corpus, a different order for every researcher.
- Random oracles are practical: a paradigm for designing efficient protocols
- New Directions in Cryptography
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- Probabilistic Encryption
- A method for obtaining digital signatures and public-key cryptosystems
- Identity-Based Encryption from the Weil Pairing
- A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack
- A public key cryptosystem and a signature scheme based on discrete logarithms
- How to Prove Yourself: Practical Solutions to Identification and Signature Problems
- Untraceable electronic mail, return addresses, and digital pseudonyms
Their papers
- Key-Privacy in Public-Key Encryption (2001) — 511 citations
- Fully Collusion Secure Dynamic Broadcast Encryption with Constant-Size Ciphertexts or Decryption Keys (2007) — 321 citations
- Security Arguments for Digital Signatures and Blind Signatures (2015) — 1,454 citations
- The Gap-Problems: A New Class of Problems for the Security of Cryptographic Schemes (2001) — 504 citations
- Short Randomizable Signatures (2016) — 356 citations
- Simple Functional Encryption Schemes for Inner Products (2015) — 352 citations
- Simple Password-Based Encrypted Key Exchange Protocols (2005) — 355 citations
- Password-Based Authenticated Key Exchange in the Three-Party Setting (2005) — 951 citations
- How to Disembed a Program? (2004) — 410 citations
- A Simple Public-Key Cryptosystem with a Double Trapdoor Decryption Mechanism and Its Applications (2003) — 341 citations
- The One-More-RSA-Inversion Problems and the Security of Chaum's Blind Signature Scheme (2003) — 399 citations
- Le chiffrement asymétrique et la sécurité prouvée (2002)
- Provably authenticated group Diffie-Hellman key exchange (2001) — 428 citations
- RSA-OAEP Is Secure under the RSA Assumption (2001) — 431 citations
- Practical multi-candidate election system (2001) — 340 citations
- Authenticated Key Exchange Secure against Dictionary Attacks (2000) — 1,572 citations
- Relations among Notions of Security for Public-Key Encryption Schemes (1998)