Share This Author
Security Arguments for Digital Signatures and Blind Signatures
It is proved that a very slight variation of the well-known El Gamal signature scheme resists existential forgeries even against an adaptively chosen-message attack and an appropriate notion of security related to the setting of electronic cash is defined.
Security Proofs for Signature Schemes
This paper establishes the generality of this technique against adaptively chosen message attacks and achieves such a security proof for a slight variant of the El Garrial signature schemc where committed values are hashed together with the message.
A method for finding codewords of small weight
- J. Stern
- Computer ScienceCoding Theory and Applications
- 1 September 1989
A probabilistic algorithm can be used to discover words of small weight in a linear binary code, which is asymptotically quite large but can be applied for codes of a medium size.
A New Identification Scheme Based on Syndrome Decoding
- J. Stern
- Computer Science, MathematicsCRYPTO
- 22 August 1993
This paper proposes a new identification scheme, based on error-correcting codes, which is zero-knowledge and is of practical value, and describes several variants, including one which has an identity based character.
RSA-OAEP Is Secure under the RSA Assumption
- E. Fujisaki, T. Okamoto, D. Pointcheval, J. Stern
- Computer Science, MathematicsJournal of Cryptology
- 19 August 2001
It is proved that OAEP offers semantic security against adaptive chosen-ciphertext attacks, in the random oracle model, under the partial-domain one-wayness of the underlying permutation.
A new paradigm for public key identification
- J. Stern
- Computer Science, MathematicsIEEE Trans. Inf. Theory
- 1 November 1996
This paper proposes a new identification scheme, based on error-correcting codes, which is zero-knowledge and seems of practical value, and describes several variants, including one which has an identity-based character.
The hardness of approximate optima in lattices, codes, and systems of linear equations
- Sanjeev Arora, L. Babai, J. Stern, E. Sweedyk
- Mathematics, Computer ScienceProceedings of IEEE 34th Annual Foundations of…
The Nearest Lattice Vector Problem (in any l/sub p/ norm), the Nearest Code-word Problem for binary codes, the problem of learning a halfspace in the presence of errors, and some other problems are proved.
A new public key cryptosystem based on higher residues
The probabilistic version of the scheme is an homomorphic encryption scheme whose expansion rate is much better than previously proposed such systems and has se- mantic security, relative to the hardness of computing higher residues for suitable moduli.
Sharing Decryption in the Context of Voting or Lotteries
- Pierre-Alain Fouque, G. Poupard, J. Stern
- Computer Science, MathematicsFinancial Cryptography
- 20 February 2000
A distributed version of the Paillier cryptosystem presented at Eurocrypt '99 is proposed, which can be used in an electronic voting scheme or in a lottery where a random number related to the winning ticket has to be jointly chosen by all participants.
Provably Secure Blind Signature Schemes
This paper proposes a definition of security for blind signatures, with application to electronic cash, and focuses on a specific example which can be successfully transformed in a provably secure blind signature scheme.