A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
From MaRDI portal
Publication:2974477
DOI10.1007/3-540-39568-7_2zbMath1359.94590OpenAlexW1534388293WikidataQ52600627 ScholiaQ52600627MaRDI QIDQ2974477
Publication date: 10 April 2017
Published in: Advances in Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-39568-7_2
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Data encryption (aspects in computer science) (68P25)
Related Items
A New Paradigm for Public-Key Functional Encryption for Degree-2 Polynomials ⋮ Bringing Order to Chaos: The Case of Collision-Resistant Chameleon-Hashes ⋮ Unnamed Item ⋮ Outsourced Privacy-Preserving Random Decision Tree Algorithm Under Multiple Parties for Sensor-Cloud Integration ⋮ Making Private Function Evaluation Safer, Faster, and Simpler ⋮ Compressed $$\varSigma $$-Protocols for Bilinear Group Arithmetic Circuits and Application to Logarithmic Transparent Threshold Signatures ⋮ On the (im)possibility of secure ElGamal blind signatures ⋮ An efficient identity tracing scheme for blockchain-based systems ⋮ Privacy-preserving blueprints ⋮ Algebraic restriction codes and their applications ⋮ Tracing a linear subspace: application to linearly-homomorphic group signatures ⋮ Deniable authentication when signing keys leak ⋮ On the security of functional encryption in the generic group model ⋮ Elliptic curve cryptography; applications, challenges, recent advances, and future trends: a comprehensive survey ⋮ I want to ride my \texttt{BICYCL} : \texttt{BICYCL} implements cryptography in class groups ⋮ Towards practical topology-hiding computation ⋮ Anamorphic signatures: secrecy from a dictator who only permits authentication! ⋮ Generic constructions of master-key KDM secure attribute-based encryption ⋮ On one-way ring homomorphisms ⋮ Astrolabous: a universally composable time-lock encryption scheme ⋮ Key encapsulation mechanism with tight enhanced security in the multi-user setting: impossibility result and optimal tightness ⋮ $$\mathsf {HIKE}$$ : Walking the Privacy Trail ⋮ Public-key encryption from homogeneous CLWE ⋮ Towards practical homomorphic time-lock puzzles: applicability and verifiability ⋮ Endemic oblivious transfer via random oracles, revisited ⋮ Network-agnostic security comes (almost) for free in DKG and MPC ⋮ Compact structure-preserving signatures with almost tight security ⋮ Cut Down the Tree to Achieve Constant Complexity in Divisible E-cash ⋮ Computation of a 768-Bit Prime Field Discrete Logarithm ⋮ Concurrently Composable Security with Shielded Super-Polynomial Simulators ⋮ Linearly Homomorphic Authenticated Encryption with Provable Correctness and Public Verifiability ⋮ Unidirectional Chosen-Ciphertext Secure Proxy Re-encryption ⋮ Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries ⋮ Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries ⋮ Koblitz Curves and Integer Equivalents of Frobenius Expansions ⋮ Extended security arguments for signature schemes ⋮ Provably Secure (Broadcast) Homomorphic Signcryption ⋮ Encoding of Rational Numbers and Their Homomorphic Computations for FHE-Based Applications ⋮ Minicrypt primitives with algebraic structure and applications ⋮ Threshold-directed signature scheme based on hybrid number theoretic problems ⋮ Chosen-Ciphertext Secure Proxy Re-encryption without Pairings ⋮ Cryptanalysis of MOR and Discrete Logarithms in Inner Automorphism Groups ⋮ Type-Based Proxy Re-encryption and Its Construction ⋮ A Tamper-Evident Voting Machine Resistant to Covert Channels ⋮ Digital Signatures ⋮ Real Hidden Identity-Based Signatures ⋮ How to Challenge and Cast Your e-Vote ⋮ Enhanced Digital Signature Using RNS Digit Exponent Representation ⋮ Generic construction for tightly-secure signatures from discrete log ⋮ More efficient shuffle argument from unique factorization ⋮ A closer look at multiple forking: leveraging (in)dependence for a tighter bound ⋮ Automata evaluation and text search protocols with simulation-based security ⋮ Robust key authentication scheme resistant to public key substitution attacks ⋮ Tweakable block ciphers secure beyond the birthday bound in the ideal cipher model ⋮ Anonymous Authentication with Optional Shared Anonymity Revocation and Linkability ⋮ Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares ⋮ The Dark Side of “Black-Box” Cryptography or: Should We Trust Capstone? ⋮ Attacking (EC)DSA Given Only an Implicit Hint ⋮ Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity ⋮ Generic plaintext equality and inequality proofs ⋮ Versatile and sustainable timed-release encryption and sequential time-lock puzzles (extended abstract) ⋮ Delegation with supervision ⋮ Improved zero-knowledge argument of encrypted extended permutation ⋮ Efficient attribute-based proxy re-encryption with constant size ciphertexts ⋮ Simpler constructions of asymmetric primitives from obfuscation ⋮ Certificateless Proxy Re-Encryption Without Pairings ⋮ Cramer-Damgård signatures revisited: Efficient flat-tree signatures based on factoring ⋮ A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement ⋮ Reconciling non-malleability with homomorphic encryption ⋮ Short signatures from Diffie-Hellman: realizing almost compact public key ⋮ On the Menezes-Teske-Weng conjecture ⋮ A lightweight dynamic pseudonym identity based authentication and key agreement protocol without verification tables for multi-server architecture ⋮ Privacy and verifiability in voting systems: methods, developments and trends ⋮ Breaking the decisional Diffie-Hellman problem for class group actions using genus theory: extended version ⋮ Structure-Preserving Smooth Projective Hashing ⋮ Systematizing core properties of pairing-based attribute-based encryption to uncover remaining challenges in enforcing access control in practice ⋮ Iterated Random Oracle: A Universal Approach for Finding Loss in Security Reduction ⋮ Layouts for improved hierarchical parallel computations ⋮ A Static Diffie-Hellman Attack on Several Direct Anonymous Attestation Schemes ⋮ A suite of algorithms for key distribution and authentication in centralized secure multicast environments ⋮ Multikey Fully Homomorphic Encryption and Applications ⋮ Homomorphic extensions of CRT-based secret sharing ⋮ Cryptanalysis on Mu-Varadharajan's e-voting schemes ⋮ Lattice attacks against elliptic-curve signatures with blinded scalar multiplication ⋮ Elliptic curve discrete logarithm problem over small degree extension fields ⋮ Security analysis of the public key algorithm based on Chebyshev polynomials over the integer ring \(Z_{N}\) ⋮ Practical Secure Naïve Bayesian Classification Over Encrypted Big Data in Cloud ⋮ Efficient set operations in the presence of malicious adversaries ⋮ Modular Reduction in GF(2 n ) without Pre-computational Phase ⋮ Environmentally friendly composable multi-party computation in the plain model from standard (timed) assumptions ⋮ An efficient quantum somewhat homomorphic symmetric searchable encryption ⋮ Survey on hardware implementation of random number generators on FPGA: theory and experimental analyses ⋮ On the impossibility of purely algebraic signatures ⋮ Non-malleable encryption: simpler, shorter, stronger ⋮ Homomorphic secret sharing for low degree polynomials ⋮ On the impossibility of structure-preserving deterministic primitives ⋮ New Realizations of Efficient and Secure Private Set Intersection Protocols Preserving Fairness ⋮ Authentic Quantum Nonces ⋮ Breaking and Fixing Anonymous Credentials for the Cloud ⋮ Integer Reconstruction Public-Key Encryption ⋮ Signcryption Schemes Based on the Diffie–Hellman Problem ⋮ Tightly secure ring signatures in the standard model ⋮ Sliding encryption: A cryptographic tool for mobile agents ⋮ Public-Key Encryption with Delegated Search ⋮ Benaloh’s Dense Probabilistic Encryption Revisited ⋮ Adaptively Secure Non-interactive Threshold Cryptosystems ⋮ Threshold circuit lower bounds on cryptographic functions ⋮ Privacy-preserving restricted Boltzmann machine ⋮ Speeding up exponentiation using an untrusted computational resource ⋮ Subtleties in the definition of IND-CCA: when and how should challenge decryption be disallowed? ⋮ On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles ⋮ Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles ⋮ Tracing Malicious Proxies in Proxy Re-encryption ⋮ Fair Traceable Multi-Group Signatures ⋮ Indiscreet logarithms in finite fields of small characteristic ⋮ Generic Construction of UC-Secure Oblivious Transfer ⋮ Post-Quantum Cryptography: State of the Art ⋮ Secure ElGamal-Type Cryptosystems Without Message Encoding ⋮ Efficient Secure Two-Party Exponentiation ⋮ Encrypted data processing with homomorphic re-encryption ⋮ Minimizing the Number of Bootstrappings in Fully Homomorphic Encryption ⋮ Verifiable random functions: relations to identity-based key encapsulation and new constructions ⋮ Realizing Hash-and-Sign Signatures under Standard Assumptions ⋮ Optimal Randomness Extraction from a Diffie-Hellman Element ⋮ A New Randomness Extraction Paradigm for Hybrid Encryption ⋮ Accelerating Oblivious Transfer with Batch Multi-exponentiation ⋮ Boosting verifiable computation on encrypted data ⋮ Another Look at Extended Private Information Retrieval Protocols ⋮ Legally Fair Contract Signing Without Keystones ⋮ Offline Witness Encryption ⋮ BETA: biometric-enabled threshold authentication ⋮ Network-Hiding Communication and Applications to Multi-party Protocols ⋮ Filling the gap between voters and cryptography in e-voting ⋮ Efficient Conditional Proxy Re-encryption with Chosen-Ciphertext Security ⋮ Quasi-quadratic elliptic curve point counting using rigid cohomology ⋮ Publicly Verifiable Secret Sharing for Cloud-Based Key Management ⋮ Authenticated Byzantine Generals in Dual Failure Model ⋮ Efficiency Limitations for Σ-Protocols for Group Homomorphisms ⋮ Quantum binary search algorithm ⋮ Cryptosystems based on semi-distributive algebras ⋮ Efficient big integer multiplication and squaring algorithms for cryptographic applications ⋮ Time-and-ID-based proxy reencryption scheme ⋮ On succinct arguments and witness encryption from groups ⋮ Breaking the decisional Diffie-Hellman problem for class group actions using genus theory ⋮ Comment on the ``Quantum public-key cryptosystem ⋮ Synchronization of a novel fractional order stretch-twist-fold (STF) flow chaotic system and its application to a new authenticated encryption scheme (AES) ⋮ Generic transformation from broadcast encryption to round-optimal deniable ring authentication ⋮ Blind polynomial evaluation and data trading
