Pages that link to "Item:Q2974477"
From MaRDI portal
The following pages link to A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms (Q2974477):
Displaying 50 items.
- A closer look at multiple forking: leveraging (in)dependence for a tighter bound (Q289922) (← links)
- Automata evaluation and text search protocols with simulation-based security (Q290379) (← links)
- Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares (Q306248) (← links)
- A lightweight dynamic pseudonym identity based authentication and key agreement protocol without verification tables for multi-server architecture (Q395006) (← links)
- Privacy and verifiability in voting systems: methods, developments and trends (Q395657) (← links)
- Layouts for improved hierarchical parallel computations (Q405569) (← links)
- A suite of algorithms for key distribution and authentication in centralized secure multicast environments (Q415239) (← links)
- Security analysis of the public key algorithm based on Chebyshev polynomials over the integer ring \(Z_{N}\) (Q429602) (← links)
- Efficient set operations in the presence of malicious adversaries (Q434343) (← links)
- Verifiable random functions: relations to identity-based key encapsulation and new constructions (Q744351) (← links)
- Generic construction for tightly-secure signatures from discrete log (Q820557) (← links)
- More efficient shuffle argument from unique factorization (Q826262) (← links)
- Cramer-Damgård signatures revisited: Efficient flat-tree signatures based on factoring (Q868950) (← links)
- Filling the gap between voters and cryptography in e-voting (Q1028368) (← links)
- Quasi-quadratic elliptic curve point counting using rigid cohomology (Q1030255) (← links)
- Cryptosystems based on semi-distributive algebras (Q1042600) (← links)
- A key distribution system equivalent to factoring (Q1112781) (← links)
- Cryptanalysis on Mu-Varadharajan's e-voting schemes (Q1406209) (← links)
- Tweakable block ciphers secure beyond the birthday bound in the ideal cipher model (Q1633458) (← links)
- Lattice attacks against elliptic-curve signatures with blinded scalar multiplication (Q1698621) (← links)
- An efficient quantum somewhat homomorphic symmetric searchable encryption (Q1705121) (← links)
- Survey on hardware implementation of random number generators on FPGA: theory and experimental analyses (Q1706614) (← links)
- Homomorphic secret sharing for low degree polynomials (Q1710675) (← links)
- On the impossibility of structure-preserving deterministic primitives (Q1715860) (← links)
- Indiscreet logarithms in finite fields of small characteristic (Q1783724) (← links)
- Robust key authentication scheme resistant to public key substitution attacks (Q1888257) (← links)
- Elliptic curve discrete logarithm problem over small degree extension fields (Q1946599) (← links)
- The Diffie-Hellman protocol (Q1976038) (← links)
- Subtleties in the definition of IND-CCA: when and how should challenge decryption be disallowed? (Q2018816) (← links)
- Boosting verifiable computation on encrypted data (Q2055689) (← links)
- BETA: biometric-enabled threshold authentication (Q2061958) (← links)
- On succinct arguments and witness encryption from groups (Q2096510) (← links)
- Breaking the decisional Diffie-Hellman problem for class group actions using genus theory (Q2096518) (← links)
- Generic transformation from broadcast encryption to round-optimal deniable ring authentication (Q2115719) (← links)
- Blind polynomial evaluation and data trading (Q2117031) (← links)
- Generic plaintext equality and inequality proofs (Q2145406) (← links)
- Versatile and sustainable timed-release encryption and sequential time-lock puzzles (extended abstract) (Q2148748) (← links)
- Improved zero-knowledge argument of encrypted extended permutation (Q2151308) (← links)
- Efficient attribute-based proxy re-encryption with constant size ciphertexts (Q2152056) (← links)
- Simpler constructions of asymmetric primitives from obfuscation (Q2152062) (← links)
- A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement (Q2175906) (← links)
- On the Menezes-Teske-Weng conjecture (Q2179501) (← links)
- Homomorphic extensions of CRT-based secret sharing (Q2197441) (← links)
- Non-malleable encryption: simpler, shorter, stronger (Q2210445) (← links)
- Tightly secure ring signatures in the standard model (Q2235773) (← links)
- Privacy-preserving restricted Boltzmann machine (Q2262401) (← links)
- Encrypted data processing with homomorphic re-encryption (Q2293264) (← links)
- Quantum binary search algorithm (Q2323771) (← links)
- Efficient big integer multiplication and squaring algorithms for cryptographic applications (Q2336123) (← links)
- Time-and-ID-based proxy reencryption scheme (Q2336347) (← links)
