A Public-Key Encryption Scheme with Pseudo-random Ciphertexts

DOI10.1007/978-3-540-30108-0_21zbMath1487.94135OpenAlexW1520041135WikidataQ57318681 ScholiaQ57318681MaRDI QIDQ5862315

Bodo Möller

Publication date: 7 March 2022

Published in: Computer Security – ESORICS 2004 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-30108-0_21

zbMATH Keywords

elliptic curveelliptic curve cryptographystream ciphermessage authentication codeelliptic curf

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (4)

The \(\mathbb Q\)-curve construction for endomorphism-accelerated elliptic curves ⋮ Batching base oblivious transfers ⋮ On a new formal proof model for RFID location privacy ⋮ Security of Auditing Protocols Against Subversion Attacks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Probabilistic encryption
• One-way permutations on elliptic curves
• The random oracle methodology, revisited
• The Probability that the Number of Points on an Elliptic Curve over a Finite Field is Prime
• Keying Hash Functions for Message Authentication
• Elliptic Curve Cryptosystems
• New directions in cryptography
• Reducing elliptic curve logarithms to logarithms in a finite field
• Equivalence between Semantic Security and Indistinguishability against Chosen Ciphertext Attacks
• Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
• Foundations of Cryptography
• Advances in Cryptology - EUROCRYPT 2004
• Theory of Cryptography

This page was built for publication: A Public-Key Encryption Scheme with Pseudo-random Ciphertexts