Nick Howgrave-Graham

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Rosario Gennaro

> Home > Persons > Nick Howgrave-Graham

Publications

2002
[j2]
- view
  authority control:
- export record
  dblp key:
  - journals/joc/CatalanoGH02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/joc/CatalanoGH02
Dario Catalano, Rosario Gennaro, Nick Howgrave-Graham:
Paillier's Trapdoor Function Hides up to O(n) Bits. J. Cryptol. 15(4): 251-269 (2002)
2001
[c6]
- view
  authority control:
- export record
  dblp key:
  - conf/ccs/CatalanoGHN01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ccs/CatalanoGHN01
Dario Catalano, Rosario Gennaro, Nick Howgrave-Graham, Phong Q. Nguyen:
Paillier's cryptosystem revisited. CCS 2001: 206-214
[c5]
- view
  authority control:
- export record
  dblp key:
  - conf/ches/Howgrave-GrahamDG01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ches/Howgrave-GrahamDG01
Nick Howgrave-Graham, Joan G. Dyer, Rosario Gennaro:
Pseudo-random Number Generation on the IBM 4758 Secure Crypto Coprocessor. CHES 2001: 93-102
[c4]
- view
  authority control:
- export record
  dblp key:
  - conf/eurocrypt/CatalanoGH01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/eurocrypt/CatalanoGH01
Dario Catalano, Rosario Gennaro, Nick Howgrave-Graham:
The Bit Security of Paillier's Encryption Scheme and Its Applications. EUROCRYPT 2001: 229-243

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.