A public key cryptosystem and a signature scheme based on discrete logarithms
DOI10.1109/TIT.1985.1057074zbMATH Open0571.94014DBLPconf/crypto/Gamal84WikidataQ52600627 ScholiaQ52600627MaRDI QIDQ3689092FDOQ3689092
Publication date: 1985
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- Probabilistic encryption
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
- Multirecipient Encryption Schemes: How to Save on Bandwidth and Computation Without Sacrificing Security
- Title not available (Why is that?)
- Chosen-Ciphertext Security via Correlated Products
- Orthogonality between Key Privacy and Data Privacy, Revisited
Cited In (only showing first 100 items - show all)
- Signcryption schemes with insider security in an ideal permutation model
- Probabilistic Functions and Cryptographic Oracles in Higher Order Logic
- Message transmission for GH-public key cryptosystem
- Small generic hardcore subsets for the discrete logarithm: short secret DL-keys.
- Chosen Ciphertext Secure Keyed-Homomorphic Public-Key Encryption
- A password authentication scheme based on discrete logarithms
- Public key cryptography using semigroup actions and semirings
- A new signature scheme based on factoring and discrete logarithms
- Some basics on privacy techniques, anonymization and their big data challenges
- Partial information in public key cryptography
- Improved authenticated multiple-key agreement protocol without using conventional one-way function.
- Nonrepudiable proxy multi-signature scheme
- Input-trees of finite automata and application to cryptanalysis
- Round-optimal secure multi-party computation
- Modular Reduction in GF(2 n ) without Pre-computational Phase
- Memory lower bounds of reductions revisited
- An XML multisignature scheme.
- Fast direct computation of modular reduction
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption
- Bounds in Various Generalized Settings of the Discrete Logarithm Problem
- Review of cryptographic schemes applied to remote electronic voting systems: remaining challenges and the upcoming post-quantum paradigm
- Design of a linear systolic array for computing modular multiplication and squaring in \(\text{GF}(2^m)\)
- Efficient on-line electronic checks
- Partially structure-preserving signatures: lower bounds, constructions and more
- Elliptic curve based hardware architecture using cellular automata
- More efficient structure-preserving signatures -- or: bypassing the type-III lower bounds
- Chosen ciphertext secure keyed-homomorphic public-key cryptosystems
- A design of fast pipelined modular multiplier based on a diminished-radix algorithm
- User impersonation in key certification schemes
- Privacy-preserving ridge regression on distributed data
- A Calculus for Game-Based Security Proofs
- Batch RSA signature scheme
- Improvement of the Miyazaki-Takaragi threshold digital signature scheme
- Formal security proofs with minimal fuss: implicit computational complexity at work
- Provably secure and pairing-free certificateless digital signature scheme using elliptic curve cryptography
- Properties of certain semigroups and their potential as platforms for cryptosystems
- Cryptosystems based on semi-distributive algebras
- Improvement of signature scheme based on factoring and discrete logarithms
- Self-certified multi-proxy signature schemes with message recovery
- An Efficient Post-Quantum One-Time Signature Scheme
- Can Montgomery parasites be avoided? A design methodology based on key and cryptosystem modifications
- Integrating authentication in public key distribution system
- Speeding up the computations of elliptic curves cryptoschemes
- How to sign digital streams
- Cryptography from Learning Parity with Noise
- Carryless addition
- New efficient and secure protocols for verifiable signature sharing and other applications
- Dynamic threshold secret reconstruction and its application to the threshold cryptography
- Non-Interactive Key Exchange
- Fault Attacks on Public Key Elements: Application to DLP-Based Schemes
- Privacy preserving distributed optimization using homomorphic encryption
- Preimage selective trapdoor function: how to repair an easy problem
- Cryptanalysis and an Improvement of New Remote Mutual Authentication Scheme using Smart Cards
- Strong Designated Verifier Signature Scheme Based on Discrete Logarithm Problem
- On the algebraic structure of \(E_p^{(m)}\) and applications to cryptography
- Adaptively secure distributed public-key systems.
- New multisignature scheme for specified group of verifiers
- Improved digital signature scheme based on factoring and discrete logarithms
- Efficient public key encryption with equality test in the standard model
- A simple provably secure AKE from the LWE problem
- An efficient quantum digital signature for classical messages
- XTR Algorithm: Efficient and Compact Subgroup Trace Representation
- Fast generation of prime numbers and secure public-key cryptographic parameters.
- Public key encryption with equality test from generic assumptions in the random oracle model
- Acoustic cryptanalysis
- What security can we achieve within 4 rounds?
- Finite field arithmetic using quasi-normal bases
- Repairing ElGamal-like multi-signature schemes using self-certified public keys
- AOP arithmetic architectures over GF(2\(^m\))
- Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs
- Strengthening Security of RSA-OAEP
- Survey on SAP and its application in public-key cryptography
- Delegating a product of group exponentiations with application to signature schemes
- Secure and efficient multiparty private set intersection cardinality
- A fast modular square computing method based on the generalized Chinese remainder theorem for prime moduli
- Digital signature with message recovery using self-certified public keys without trustworthy system authority
- A new characterization of dual bases in finite fields and its applications
- CryptHOL: game-based proofs in higher-order logic
- Self-certified threshold proxy signature schemes with message recovery, nonrepudiation, and traceability
- Privacy preserving anomaly detection based on local density estimation
- The multiple number field sieve for medium- and high-characteristic finite fields
- Meta-He digital signatures based on factoring and discrete logarithms
- An efficient approach for secure multi-party computation without authenticated channel
- Accumulable Optimistic Fair Exchange from Verifiably Encrypted Homomorphic Signatures
- Graph coloring applied to secure computation in non-abelian groups
- Algebraic secret sharing using privacy homomorphisms for IoT-based healthcare systems
- CCA-security from adaptive all-but-one lossy trapdoor functions
- Selectively linkable group signatures -- stronger security and preserved verifiability
- Non-associative public-key cryptography
- Cryptanalysis of a remote password authentication scheme
- Side Channels in the McEliece PKC
- Fast group operations on elliptic curves in Maple
- Special prime numbers and discrete logs in finite prime fields
- Obstacles to the torsion-subgroup attack on the decision Diffie-Hellman Problem
- A secure and efficient authentication protocol for anonymous channel in wireless communications
- Scalable Multi-party Private Set-Intersection
- Prime-number algorithm for public-key systems
- A new digital signature scheme based on factoring and discrete logarithms
- Analysis of the variable length nonzero window method for exponentiation
- Threshold verification scheme to a valid-signature using identity only on specialized approval
Recommendations
This page was built for publication: A public key cryptosystem and a signature scheme based on discrete logarithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3689092)