• Publications
  • Influence
Security Arguments for Digital Signatures and Blind Signatures
TLDR
We study the security of blind signatures, especially for their application in electronic cash systems. Expand
Security Proofs for Signature Schemes
TLDR
In this paper, we address the question of providing security proofs for signature schemes in the so-called random oracle model [1] where committed values are hashed together with the message. Expand
A method for finding codewords of small weight
  • J. Stern
  • Computer Science
  • Coding Theory and Applications
  • 1 September 1989
TLDR
We describe a probabilistic algorithm, which can be used to discover words of small weight in a linear binary code. Expand
A New Identification Scheme Based on Syndrome Decoding
  • J. Stern
  • Computer Science
  • CRYPTO
  • 22 August 1993
TLDR
We propose a new identification scheme, based on error-correcting codes, which is zero-knowledge and is of practical value. Expand
A new paradigm for public key identification
  • J. Stern
  • Mathematics, Computer Science
  • IEEE Trans. Inf. Theory
  • 1 November 1996
TLDR
We propose a new identification scheme, based on error-correcting codes, which is zero-knowledge and seems of practical value. Expand
RSA-OAEP Is Secure under the RSA Assumption
TLDR
This paper establishes another result on the security of OAEP under the partial-domain one-wayness of the underlying trapdoor permutation. Expand
The hardness of approximate optima in lattices, codes, and systems of linear equations
TLDR
We prove the following about the Nearest Lattice Vector Problem (in any l/sub p/ norm), Nearest Code-word Problem for binary codes, the problem of learning a halfspace in the presence of errors, and some other problems. Expand
Sharing Decryption in the Context of Voting or Lotteries
TLDR
We propose a distributed version of the Paillier cryptosystem presented at Eurocrypt '99, which allows to perform computation with encrypted data without the knowledge of any secret information. Expand
A new public key cryptosystem based on higher residues
TLDR
This paper describes a new public-key cryptosystem based on the hardness of computing higher residues modulo a composite RSA integer. Expand
Provably Secure Blind Signature Schemes
TLDR
In this paper, we give a provably secure design for blind signatures, the most important ingredient for anonymity in off-line electronic cash systems. Expand
...
1
2
3
4
5
...