Paper Search Console

Home Search Page About Contact

Journal Title

Title of Journal: J Cryptology

Search In Journal Title:

Abbravation: Journal of Cryptology

Search In Journal Abbravation:

Publisher

Springer-Verlag

Search In Publisher:

DOI

10.1007/0-306-48332-7_145

Search In DOI:

ISSN

1432-1378

Search In ISSN:
Search In Title Of Papers:

Formal Proofs for the Security of Signcryption

Authors: Joonsang Baek Ron Steinfeld Yuliang Zheng
Publish Date: 2007/03/21
Volume: 20, Issue: 2, Pages: 203-235
PDF Link

Abstract

Signcryption is an asymmetric cryptographic method that provides simultaneously both message confidentiality and unforgeability at a low computational and communication overhead In this paper we propose realistic security models for signcryption which give the attacker power to choose both messages/signcryptexts as well as recipient/sender public keys when accessing the signcryption/unsigncryption oracles of attacked entities We then show that Zhengs original signcryption scheme is secure in our confidentiality model relative to the Gap DiffieHellman problem and is secure in our unforgeability model relative to a Gap version of the discrete logarithm problem All these results are shown in the random oracle model

Keywords:

References

.
Search In Abstract Of Papers:
Other Papers In This Journal:
  1. Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs
  2. Resource Requirements of Private Quantum Channels and Consequences for Oblivious Remote State Preparation
  3. Concurrent Knowledge Extraction in Public-Key Models
  4. Jacobian Coordinates on Genus 2 Curves
  5. On the Amortized Complexity of Zero-Knowledge Protocols
  6. On the Efficient Generation of Prime-Order Elliptic Curves
  7. Sequential Aggregate Signatures, Multisignatures, and Verifiably Encrypted Signatures Without Random Oracles
  8. Accelerating Pollard’s Rho Algorithm on Finite Fields
  9. The Improbability That an Elliptic Curve Has Subexponential Discrete Log Problem under the Menezes—Okamoto—Vanstone Algorithm
  10. Constant-Round Oblivious Transfer in the Bounded Storage Model
  11. The Discrete Logarithm Problem on Elliptic Curves of Trace One
  12. Short Signatures from Diffie–Hellman: Realizing Almost Compact Public Key
  13. Integral Cryptanalysis on Full MISTY1
  14. Integral Cryptanalysis on Full MISTY1
  15. Universally Composable Symbolic Security Analysis
Search Result: