A public key cryptosystem and a signature scheme based on discrete logarithms

From MaRDI portal

Publication:3689092

Jump to:navigation, search

DOI10.1109/TIT.1985.1057074zbMath0571.94014WikidataQ52600627 ScholiaQ52600627MaRDI QIDQ3689092

Taher Elgamal

Publication date: 1985

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

zbMATH Keywords

security Diffie-Hellman key distribution scheme discrete logarithms over finite fields

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Number-theoretic algorithms; complexity (11Y16) Authentication, digital signatures and secret sharing (94A62)

Related Items

Pairings in local fields and cryptography, A novel text and image encryption method based on chaos theory and DNA computing, Efficient set intersection with simulation-based security, Concurrent knowledge extraction in public-key models, SoK: how (not) to design and implement post-quantum cryptography, (EC)DSA lattice attacks based on Coppersmith's method, How to construct efficient signcryption schemes on elliptic curves, New lattice attacks on DSA schemes, Digital signature algorithm for securing digital identities, Tightly secure signatures and public-key encryption, Bug attacks, A review on the isomorphism classes of hyperelliptic curves of genus 2 over finite fields admitting a Weierstrass point, Classifying and generating exact coset representatives of \(\operatorname{PGL}_2(\mathbb{F}_q)\) in \(\operatorname{PGL}_2(\mathbb{F}_{q^2})\), Partial information in public key cryptography, Public key protocols over the ring \(E_{p}^{(m)}\), A semantically secure public key cryptoscheme using bit-pair shadows, A provably secure non-iterative hash function resisting birthday attack, Reputation management and signature delegation: A distributed approach, A key distribution system equivalent to factoring, A key-exchange system based on imaginary quadratic fields, Studying the performance of artificial neural networks on problems related to cryptography, An efficient Montgomery exponentiation algorithm by using signed-digit-recoding and folding techniques, Electronic jury voting protocols, On the design of time-stamped signatures, New field of cryptography: DNA cryptography, Hyperelliptic cryptosystems, A verifiable secret shuffle of homomorphic encryptions, Fast modular multi-exponentiation using modified complex arithmetic, An identity-based cryptographic model for discrete logarithm and integer factoring based cryptosystem, Efficient proxy signcryption scheme with provable CCA and CMA security, An efficient collision detection method for computing discrete logarithms with Pollard's rho, Two-server password-only authenticated key exchange, A public key cryptosystem based on three new provable problems, Fair exchange of valuable information: a generalised framework, Some lattice attacks on DSA and ECDSA, Accelerating Pollard's rho algorithm on finite fields, Discrete logarithm based additively homomorphic encryption and secure data aggregation, A survey of some applications of finite fields, Scheduling in a dynamic heterogeneous distributed system using estimation error, Improved Pollard rho method for computing discrete logarithms over finite extension fields, A Cartesian product construction for unconditionally secure authentication codes that permit arbitration, Calculating optimal addition chains, Star reduction among minimal length addition chains, Computing elliptic curve discrete logarithms with the negation map, An ID-based cryptographic mechanisms based on GDLP and IFP, Lossy trapdoor functions from homomorphic reproducible encryption, A note on asynchronous multi-exponentiation algorithm using binary representation, An efficient IND-CCA2 secure Paillier-based cryptosystem, Restricted adaptive oblivious transfer, Low complexity normal bases, Certificate-based verifiably encrypted signatures from pairings, Creation of identity-based digital signature schemes from bilinear maps, Synchronization of chaotic systems using feedback controller: an application to Diffie-Hellman key exchange protocol and elgamal public key cryptosystem, Fault-based attack on Montgomery's ladder algorithm, A general construction for monoid-based knapsack protocols, An efficient ID-based cryptographic encryption based on discrete logarithm problem and integer factorization problem, Protocol completion incentive problems in cryptographic Vickrey auctions, Multi-heuristic dynamic task allocation using genetic algorithms in a heterogeneous distributed system, Secure public-key encryption scheme without random oracles, Linear decomposition method in analyzing hidden information protocols on algebraic platforms, On the security of the Lucas function, On Schnorr's preprocessing for digital signature schemes, Privacy protection in on-line shopping for electronic documents, Practical verifiably encrypted signatures without random oracles, Secure multiparty computation of solid geometric problems and their applications, Trusted computing with addition machines. I, New designing of cryptosystems based on quadratic fields, The \(l\)-th power Diffie-Hellman problem and the \(l\)-th root Diffie-Hellman problem, Efficient generic on-line/off-line (threshold) signatures without key exposure, Public-key cryptosystem based on invariants of diagonalizable groups, Should one always use repeated squaring for modular exponentiation?, Providing data confidentiality against malicious hosts in shared data spaces, A note on the security of \(\text{MST} _{3}\), Practical electronic auction scheme with strong anonymity and bidding privacy, Anonymous message communications with user hierarchy in a multicast system, A new blind signature based on the discrete logarithm problem for untraceability, Encryption of covert information into multiple statistical distributions, Asymptotic granularity reduction and its application, Improved efficiency of Kiltz07-KEM, Extensions of access structures and their cryptographic applications, Fast simultaneous scalar multiplication, Problems of cryptography as discrete optimization tasks, An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation, The ring authenticated encryption scheme-how to provide a clue wisely, Aitken and Neville inverse interpolation methods for the Lucas logarithm problem, Semantic security for the McEliece cryptosystem without random oracles, A variant of digital signature algorithm, Elliptic curve based hardware architecture using cellular automata, Computationally secure pattern matching in the presence of malicious adversaries, A public key cryptosystem based on non-abelian finite groups, Batch RSA signature scheme, Improvement of the Miyazaki-Takaragi threshold digital signature scheme, CCA secure encryption supporting authorized equality test on ciphertexts in standard model and its applications, Cryptosystems based on semi-distributive algebras, An identity-based encryption technique using subtree for fuzzy user data sharing under cloud computing environment, Self-certified multi-proxy signature schemes with message recovery, Comments on the `\(m\) out of \(n\) oblivious transfer', The design of a secure and fair sealed-bid auction service, An iterative modular multiplication algorithm in RNS, A new cryptosystem using generalized Mersenne primes, Some basics on privacy techniques, anonymization and their big data challenges, New multisignature scheme for specified group of verifiers, Repairing ElGamal-like multi-signature schemes using self-certified public keys, AOP arithmetic architectures over GF(2\(^m\)), Can Montgomery parasites be avoided? A design methodology based on key and cryptosystem modifications, Integrating authentication in public key distribution system, Fast generation of prime numbers and secure public-key cryptographic parameters., Review of cryptographic schemes applied to remote electronic voting systems: remaining challenges and the upcoming post-quantum paradigm, Speeding up the computations of elliptic curves cryptoschemes, Memory lower bounds of reductions revisited, Fiat-Shamir and correlation intractability from strong KDM-secure encryption, Analysis of sliding window techniques for exponentiation, Chosen ciphertext secure keyed-homomorphic public-key cryptosystems, Batch RSA, Quantum reversible circuit of AES-128, Carryless addition, A formal language for cryptographic protocol requirements, Message recovery for signature schemes based on the discrete logarithm problem, Cryptanalysis of a combinatorial public key cryptosystem, Graph coloring applied to secure computation in non-abelian groups, Public-key encryption based on Chebyshev polynomials over \(\mathrm{GF}(q)\), Improved authenticated multiple-key agreement protocol without using conventional one-way function., Nonrepudiable proxy multi-signature scheme, Privacy preserving distributed optimization using homomorphic encryption, Preimage selective trapdoor function: how to repair an easy problem, Analysis of the variable length nonzero window method for exponentiation, An XML multisignature scheme., Efficient public key encryption with equality test in the standard model, A novel ID-based group signature, Computation of discrete logarithms in prime fields, Parallel algorithms for modular multi-exponentiation, Efficient signature generation by smart cards, A method for computing Lucas sequences, On the algebraic structure of \(E_p^{(m)}\) and applications to cryptography, Trusted computing with addition machines. II, A simple provably secure AKE from the LWE problem, An efficient quantum digital signature for classical messages, Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs, An RSA based public-key cryptosystem for secure communication, Signcryption schemes with insider security in an ideal permutation model, Improvement of signature scheme based on factoring and discrete logarithms, 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 threshold signature scheme based on the elliptic curve cryptosystem, Efficient on-line electronic checks, Improvement of Tseng et al.'s authenticated encryption scheme with message linkages, What security can we achieve within 4 rounds?, Self-certified threshold proxy signature schemes with message recovery, nonrepudiation, and traceability, Koblitz curve cryptosystems, Meta-He digital signatures based on factoring and discrete logarithms, 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, Improved cryptanalysis of a ElGamal cryptosystem based on matrices over group rings, Reusable fuzzy extractor from the decisional Diffie-Hellman assumption, Privacy preserving anomaly detection based on local density estimation, Fast group operations on elliptic curves in Maple, CCA-security from adaptive all-but-one lossy trapdoor functions, Threshold ECDSA with an offline recovery party, A distributed networked system for secure publicly verifiable self-tallying online voting, (One) failure is not an option: bootstrapping the search for failures in lattice-based encryption schemes, Threshold schemes from isogeny assumptions, Non-interactive zero knowledge from sub-exponential DDH, Public verifiable private decision tree prediction, Prime-number algorithm for public-key systems, Impossibility on tamper-resilient cryptography with uniqueness properties, Universal proxy re-encryption, Multiparty cardinality testing for threshold private intersection, A geometric approach to homomorphic secret sharing, Two varieties of finite automaton public key cryptosystem and digital signatures, Improving the Gaudry-Schost algorithm for multidimensional discrete logarithms, A \((t,n)\) multi-secret sharing scheme, Threshold verification scheme to a valid-signature using identity only on specialized approval, Fast direct computation of modular reduction, Secure distributed storage and retrieval, Interpolation of the Zech's logarithm: explicit forms, Pell hyperbolas in DLP-based cryptosystems, Input-trees of finite automata and application to cryptanalysis, New efficient and secure protocols for verifiable signature sharing and other applications, A performance evaluation of pairing-based broadcast encryption systems, Public key signatures in the multi-user setting., Adaptively secure distributed public-key systems., Proxy signature schemes based on factoring, Function field sieve method for discrete logarithms over finite fields, Robust threshold DSS signatures, How to sign digital streams, Using smart cards to authenticate remote passwords, Efficient chain-encryption-based quantum signature scheme with semi-trusted arbitrator, Digital signature with message recovery using self-certified public keys and its variants, Two-sided malicious security for private intersection-sum with cardinality, Cryptanalysis and improvement of a \((t, n)\) threshold group signature scheme, A traceable group signature scheme., A design of fast pipelined modular multiplier based on a diminished-radix algorithm, Elliptic curve cryptosystems and their implementation, User impersonation in key certification schemes, Small generic hardcore subsets for the discrete logarithm: short secret DL-keys., Quantum signature without classical private key, An iterative modular multiplication algorithm, Coin-based multi-party fair exchange, Server-aided honest computation for cryptographic applications, The design of dynamic access control scheme with user authentication, A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols, Finite field arithmetic using quasi-normal bases, Inverse problems of chaotic dynamics and statistical analysis in providing information security in communication systems and networks, Succinct non-interactive arguments via linear interactive proofs, Privacy-preserving similarity coefficients for binary data, Clairvoyant state machine replication, Attribute-based versions of Schnorr and ElGamal, Implementing secure reporting of sexual misconduct -- revisiting WhoToo, Multi-use and unidirectional identity-based proxy re-encryption schemes, Elliptic curve scalar multiplication algorithm using complementary recoding, Certificateless signature: a new security model and an improved generic construction, When HEAAN meets FV: a new somewhat homomorphic encryption with reduced memory overhead, Selectively linkable group signatures -- stronger security and preserved verifiability, How (not) to achieve both coercion resistance and cast as intended verifiability in remote evoting, Security enhancement for digital signature schemes with fault tolerance in RSA, Threshold cryptography based on Asmuth-Bloom secret sharing, The multi-base discrete logarithm problem: tight reductions and non-rewinding proofs for Schnorr identification and signatures, Constructive \(t\)-secure homomorphic secret sharing for low degree polynomials, A pairing-free signature scheme from correlation intractable hash function and strong Diffie-Hellman assumption, Encrypted SQL arithmetic functions processing for secure cloud database, Prêt à voter with Paillier encryption, Analysis and design of a secure key exchange scheme, Algebraic secret sharing using privacy homomorphisms for IoT-based healthcare systems, Acoustic cryptanalysis, A survey on delegated computation, Some homomorphic cryptosystems based on nonassociative structures, More efficient structure-preserving signatures -- or: bypassing the type-III lower bounds, Improved signature schemes for secure multi-party computation with certified inputs, Naor-Yung paradigm with shared randomness and applications, Somewhat semantic secure public key encryption with filtered-equality-test in the standard model and its extension to searchable encryption, Asymptotically quasi-optimal cryptography, Privacy-preserving anomaly detection in cloud with lightweight homomorphic encryption, Secure server-aided data sharing clique with attestation, Secure parameterized pattern matching, Privacy-preserving computation in cyber-physical-social systems: a survey of the state-of-the-art and perspectives, An efficient approach for secure multi-party computation without authenticated channel, Privacy-preserving mixed set operations, CryptHOL: game-based proofs in higher-order logic, Cryptographic algorithms for privacy-preserving online applications, Theoretically extensible quantum digital signature with starlike cluster states, Efficient RSA key generation and threshold Paillier in the two-party setting, Cryptography on elliptic curves over \(p\) -adic number fields, Privacy-preserving ridge regression on distributed data, Privacy preserving multi-party computation delegation for deep learning in cloud computing, Gröbner basis cryptosystems, On some connections between statistics and cryptology, Reflections on the security proofs of Boneh-Franklin identity-based encryption scheme, A new digital signature scheme based on chaotic maps, Public key encryption with equality test from generic assumptions in the random oracle model, Limits of a conjecture on a leakage-resilient cryptosystem, Homomorphically encrypted \(k\)-means on cloud-hosted servers with low client-side load, A provably secure short signature scheme based on discrete logarithms, A new characterization of dual bases in finite fields and its applications, Secure distributed constraint satisfaction: reaching agreement without revealing private information, Developing the concept of one-way functions for cryptographic security systems using achievements in chaotic dynamics, Convertible multi-authenticated encryption scheme, Quantum fully homomorphic encryption scheme for cloud privacy data based on quantum circuit, A novel approach for bit-serial \(AB^{2}\) multiplication in finite fields \(\mathrm{GF}(2^m)\), An efficient and complete remote user authentication scheme using smart cards, Fair signature exchange via delegation on ubiquitous networks, Simple authenticated key agreement and protected password change protocol, Cryptanalysis of an authenticated encryption scheme using self-certified public keys, Elliptic curve cryptosystems in the presence of permanent and transient faults, Cryptanalysis and improvement on batch verifying multiple RSA digital signatures, A dynamic threshold commercial key escrow scheme based on conic, Trading inversions for multiplications in elliptic curve cryptography, Security of the design of time-stamped signatures, A password authentication scheme over insecure networks, An implementation for a fast public-key cryptosystem, One-round secure fair meeting location determination based on homomorphic encryption, Weakness of \(\mathbb{F}_{3^{6 \cdot 1429}}\) and \(\mathbb{F}_{2^{4 \cdot 3041}}\) for discrete logarithm cryptography, Semi-generic construction of public key encryption and identity-based encryption with equality test, An efficient ID-based cryptographic transformation model for extended chaotic-map-based cryptosystem, Algorithm of asynchronous binary signed-digit recoding on fast multiexponentiation, A new \((t,n)\) multi-secret sharing scheme based on Shamir's secret sharing, Remarks on some signature schemes based on factoring and discrete logarithms, Fail-stop blind signature scheme design based on pairings, A secure and efficient authentication protocol for anonymous channel in wireless communications, Cryptanalysis of some signature schemes with message recovery, One private-key for all DL-based cryptosystems, Security analysis and improvement of a double-trapdoor encryption scheme, Efficient nonrepudiable threshold proxy signature scheme with known signers against the collusion attack, Efficient algorithms for speeding up the computations of elliptic curve cryptosystems, A public-key traitor tracing scheme with revocation using dynamic shares, A public key cryptosystem based on a subgroup membership problem, Conjugacy systems based on nonabelian factorization problems and their applications in cryptography, A novel cryptosystem based on grey system theory and genetic algorithm, A pairing-based three-party authenticated encryption scheme without shared secrets, Formal security proofs with minimal fuss: implicit computational complexity at work, A common-multiplicand method to the Montgomery algorithm for speeding up exponentiation., An algorithm for modular exponentiation., Cryptanalysis of a noncommutative key exchange protocol, Sharing DSS by the Chinese remainder theorem, IND-CCA secure encryption based on a Zheng-Seberry scheme, Message transmission for GH-public key cryptosystem, Dynamic threshold secret reconstruction and its application to the threshold cryptography, Unlinkable and invisible \(\gamma \)-sanitizable signatures, Partially structure-preserving signatures: lower bounds, constructions and more, Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model, Improved Three-Way Split Formulas for Binary Polynomial Multiplication, Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting, Plaintext-Checkable Encryption, Cryptography from Learning Parity with Noise, Security analysis of discrete logarithm based cryptosystems, Information-theoretic secure verifiable secret sharing over RSA modulus, A new protocol for multi-item electronic auctions, Hidden Collisions on DSS, Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes, New Generation of Secure and Practical RSA-Based Signatures, Access Control Encryption: Enforcing Information Flow with Cryptography, A password authentication scheme based on discrete logarithms, Basics of Secrecy Coding, A Public Key Cryptoscheme Using Bit-Pairs with Provable Semantical Security, Measurement-device-independent semiquantum key distribution, Oblivious Transfer from Weakly Random Self-Reducible Public-Key Cryptosystem, Towards self-stabilizing blockchain, reconstructing totally erased blockchain, A Signature Scheme for a Dynamic Coalition Defence Environment Without Trusted Third Parties, Synchronization and an application of a novel fractional order King Cobra chaotic system, How to Obtain Fully Structure-Preserving (Automorphic) Signatures from Structure-Preserving Ones, ID-based Data Integrity Auditing Scheme from RSA with Resisting Key Exposure, Secure Naïve Bayesian Classification over Encrypted Data in Cloud, Fault Attacks on Public Key Elements: Application to DLP-Based Schemes, Robust Threshold Schemes Based on the Chinese Remainder Theorem, A Brief History of Provably-Secure Public-Key Encryption, A new quantum multi-party signature protocol based on SNOP states without arbitrator, Quantum public-key encryption schemes based on conjugate coding, Quantum reversible circuits for \(\mathrm{GF}(2^8)\) multiplication based on composite field arithmetic operations, Public-Key Cryptosystems with Primitive Power Roots of Unity, Quantum digital signature based on measurement-device-independent continuous-variable scheme, SiGamal: a supersingular isogeny-based PKE and its application to a PRF, Modular Reduction in GF(2 n ) without Pre-computational Phase, Decentralized multi-authority ABE for \(\mathsf{NC}^1\) from BDH, Code-Based Cryptosystems Using Generalized Concatenated Codes, A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks, Non-associative public-key cryptography, Encoding-Free ElGamal-Type Encryption Schemes on Elliptic Curves, Side Channels in the McEliece PKC, Simplified Submission of Inputs to Protocols, Sharing of Encrypted Files in Blockchain Made Simpler, A NOVEL IDENTITY-BASED KEY-INSULATED CONVERTIBLE AUTHENTICATED ENCRYPTION SCHEME, A Subexponential Algorithm for Discrete Logarithms Over all Finite Fields, Quadratic Error Minimization in a Distributed Environment with Privacy Preserving, On Relationship of Computational Diffie-Hellman Problem and Computational Square-Root Exponent Problem, Impersonation Attacks on a Mobile Security Protocol for End-to-End Communications, Gauss periods: orders and cryptographical applications, A new signature scheme based on factoring and discrete logarithms, Efficient and Secure Generalized Pattern Matching via Fast Fourier Transform, Electronic voting in a large-scale distributed system, Parallel exponentiation using common-multiplicand-multiplication and signed-digit-folding techniques, A public key encryption scheme based on factoring and discrete logarithm, Special prime numbers and discrete logs in finite prime fields, Cryptanalysis of a remote password authentication scheme, Security Analysis of the Strong Diffie-Hellman Problem, Composition Implies Adaptive Security in Minicrypt, Graph Design for Secure Multiparty Computation over Non-Abelian Groups, Speeding Up the Pollard Rho Method on Prime Fields, The Hidden Root Problem, Mean-set attack: cryptanalysis of Sibert et al. authentication protocol, Transformations of Cryptographic Schemes Through Interpolation Techniques, Accumulable Optimistic Fair Exchange from Verifiably Encrypted Homomorphic Signatures, Fast modular multiplication based on complement representation and canonical recoding, Public key cryptosystem MST3: cryptanalysis and realization, Probabilistic Functions and Cryptographic Oracles in Higher Order Logic, Secure ElGamal-Type Cryptosystems Without Message Encoding, Clever Arbiters Versus Malicious Adversaries, On Shortening Ciphertexts: New Constructions for Compact Public Key and Stateful Encryption Schemes, Privacy-Preserving Fingerprint Authentication Resistant to Hill-Climbing Attacks, An Efficient Post-Quantum One-Time Signature Scheme, Bit Security of the CDH Problems over Finite Fields, Cryptographic aspects of real hyperelliptic curves, Divisible On-Line/Off-Line Signatures, Strengthening Security of RSA-OAEP, Public key cryptography using semigroup actions and semirings, Asymmetric Group Key Agreement, Application of non-associative structures for construction of homomorphic cryptosystems, A NEW CONVERTIBLE AUTHENTICATED ENCRYPTION SCHEME BASED ON THE ELGAMAL CRYPTOSYSTEM, Fair Threshold Decryption with Semi-Trusted Third Parties, A Commitment-Consistent Proof of a Shuffle, Practical Threshold Signatures with Linear Secret Sharing Schemes, Anonymity from Public Key Encryption to Undeniable Signatures, On Modular Decomposition of Integers, A designated verifier signature using secret sharing technique, Attacks on provably secure proxy-protected signature schemes based on factoring, Fast exponentiation by folding the signed-digit exponent in half, Naor-Yung Paradigm with Shared Randomness and Applications, A new digital signature scheme based on factoring and discrete logarithms, Cryptanalysing the critical group: efficiently solving Biggs's discrete logarithm problem, On Constructing Homomorphic Encryption Schemes from Coding Theory, Designated Confirmer Signatures with Unified Verification, Encryption Switching Protocols, The k -ary Montgomery modular inverse over nonbinary computers, Parallel computation of the multi-exponentiation for cryptosystems, Design, Analysis and Performance Evaluation of Group Key Establishment in Wireless Sensor Networks, Ad-Hoc Threshold Broadcast Encryption with Shorter Ciphertexts, A remote password authentication scheme based on the digital signature method, A public key cryptosystem and a signature scheme based on discrete logarithms, Provably secure and pairing-free certificateless digital signature scheme using elliptic curve cryptography, Traps to the BGJT-algorithm for discrete logarithms, The multiple number field sieve for medium- and high-characteristic finite fields, Structured encryption algorithm for text cryptography, A new enhancement of elliptic curve digital signature algorithm, Cryptanalysis of NTRU where the private polynomial has one or more consecutive zero coefficients, Public key authentication scheme over quaternions, Novel Digital Signature Scheme with Multiple Private Keys on Non-commutative Division Semirings, Security properties of one “short” signature scheme, A DSA-like digital signature protocol, Improved digital signature scheme based on factoring and discrete logarithms, Hash-Based Signatures Revisited: A Dynamic FORS with Adaptive Chosen Message Security, LMS vs XMSS: Comparison of Stateful Hash-Based Signature Schemes on ARM Cortex-M4, New Ideas to Build Noise-Free Homomorphic Cryptosystems, XTR Algorithm: Efficient and Compact Subgroup Trace Representation, Boneh-Franklin IBE, Group-Based Source-Destination Verifiable Encryption with Blacklist Checking, An Improved Leveled Fully Homomorphic Encryption Scheme over the Integers, Cryptography using generalized Fibonacci matrices with Affine-Hill cipher, A generalization of the ElGamal public-key cryptosystem, Computing special powers in finite fields, Obstacles to the torsion-subgroup attack on the decision Diffie-Hellman Problem, An efficient ID-based user identification scheme for mutual authentication in mobile environments, Comments on e-mail protocols providing forward secrecy, Insecure primitive elements in an ElGamal signature protocol, Cryptanalysis and an Improvement of New Remote Mutual Authentication Scheme using Smart Cards, Strong Designated Verifier Signature Scheme Based on Discrete Logarithm Problem, Constructing ID-based cryptographic technique for IFP and GDLP based cryptosystem, Two is better than one: How to securely combine two assumptions, PARALLEL COMPUTATION OF THE MODULAR CASCADE EXPONENTIATION, Some properties of vectorial addition chains^†, Solving some cryptanalytic problems for lattice-based cryptosystems with quantum annealing method, Delayed packing attack and countermeasure against transaction information based applications, PFLM: privacy-preserving federated learning with membership proof, Unnamed Item, Unidirectional updatable encryption and proxy re-encryption from DDH, Implications of the arithmetic ratio of prime numbers for RSA security, Identity-based encryption in DDH hard groups, Comparing balanced sequences obtained from ElGamal function to random balanced sequences, Finding points on elliptic curves with Coppersmith's method, On the security of DLCSP over \(\mathrm{GL}_n (\mathbb{F}_q [S_r)\)], Homomorphic encryption: a mathematical survey, Trustworthy sealed-bid auction with low communication cost atop blockchain, Group action key encapsulation and non-interactive key exchange in the QROM, From the hardness of detecting superpositions to cryptography: quantum public key encryption and commitments, Cryptography and Digital Transformation, Bézier Coefficients Matrix for ElGamal Elliptic Curve Cryptosystem, Homomorphic secret sharing for multipartite and general adversary structures supporting parallel evaluation of low-degree polynomials, Rewriting system of certain semigroups with three generators, Faster Privacy-Preserving Location Proximity Schemes, Vector commitments over rings and compressed \(\varSigma \)-protocols, On new problems in asymmetric cryptography based on error-resistant coding, A quantum key distribution on qudits using quantum operators, A Hybrid Threshold Group Signature Scheme with Distinguished Signing Authority, A Rigorous Security Proof for the Enhanced Version of Password-Protected Secret Sharing Scheme, An ElGamal-like Secure Channel Free Public Key Encryption with Keyword Search Scheme, Delegation of cryptographic servers for capture-resilient devices, Efficient message transmission via twisted Edwards curves, Key exchange protocols over noncommutative rings. The case of, Authenticated Key Agreement Protocol Based on Provable Secure Cryptographic Functions, ROBUST MESSAGE AUTHENTICATION OVER A COLLECTIVE-NOISE CHANNEL, Chosen Ciphertext Secure Keyed-Homomorphic Public-Key Encryption, Non-Interactive Key Exchange, A Probabilistic Polynomial-time Calculus For Analysis of Cryptographic Protocols, Algebraic curves and cryptography, Access Control Encryption for Equality, Comparison, and More, Security enhancement of key authentication schemes based on discrete logarithms, Scalable Multi-party Private Set-Intersection, Functional Encryption: Deterministic to Randomized Functions from Simple Assumptions, Somewhat/Fully Homomorphic Encryption: Implementation Progresses and Challenges, Fast exponentiation based on common-multiplicand-multiplication and minimal-signed-digit techniques, A fair and efficient solution to the socialist millionaires' problem, On the Black-box Use of Somewhat Homomorphic Encryption in NonInteractive Two-Party Protocols, A Calculus for Game-Based Security Proofs, Efficient Confirmer Signatures from the “Signature of a Commitment” Paradigm, The Geometry of Provable Security: Some Proofs of Security in Which Lattices Make a Surprise Appearance, Design of a linear systolic array for computing modular multiplication and squaring in \(\text{GF}(2^m)\), A key exchange protocol using matrices over group ring, Unnamed Item, Round-optimal secure multi-party computation, Discrete logarithm problems with auxiliary inputs, Properties of certain semigroups and their potential as platforms for cryptosystems, Generic constructions of integrated PKE and PEKS, SPEEDING UP MULTI- EXPONENTIATION ALGORITHM ON A MULTICORE SYSTEM, Public-key cryptography on smart cards, How to obtain full privacy in auctions, Unnamed Item, Hybrid Damgård Is CCA1-Secure under the DDH Assumption, Cryptanalysis of MV3 Stream Cipher, Toward a Generic Construction of Universally Convertible Undeniable Signatures from Pairing-Based Signatures, Generalized ElGamal Public Key Cryptosystem Based on a New Diffie-Hellman Problem, A CCA Secure Hybrid Damgård’s ElGamal Encryption, Unnamed Item, Unnamed Item, Cryptographic Voting — A Gentle Introduction, A new NTRU cryptosystem outperforms three highly secured NTRU-analog systems through an innovational algebraic structure, A novel public-key encryption scheme based on Bass cyclic units in integral group rings, Homomorphic Encryption, Decentralized Anonymous Micropayments, Cryptanalysis of ITRU, Weak Zero-Knowledge beyond the Black-Box Barrier

Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3689092&oldid=17171873"