Pages that link to "Item:Q3689092"
From MaRDI portal
The following pages link to A public key cryptosystem and a signature scheme based on discrete logarithms (Q3689092):
Displaying 50 items.
- Coin-based multi-party fair exchange (Q2117033) (← links)
- Unlinkable and invisible \(\gamma \)-sanitizable signatures (Q2117037) (← links)
- Partially structure-preserving signatures: lower bounds, constructions and more (Q2117038) (← links)
- Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model (Q2119006) (← links)
- Succinct non-interactive arguments via linear interactive proofs (Q2136170) (← links)
- Clairvoyant state machine replication (Q2139098) (← links)
- Implementing secure reporting of sexual misconduct -- revisiting WhoToo (Q2146102) (← links)
- When HEAAN meets FV: a new somewhat homomorphic encryption with reduced memory overhead (Q2149801) (← links)
- Selectively linkable group signatures -- stronger security and preserved verifiability (Q2149824) (← links)
- How (not) to achieve both coercion resistance and cast as intended verifiability in remote evoting (Q2149844) (← links)
- The multi-base discrete logarithm problem: tight reductions and non-rewinding proofs for Schnorr identification and signatures (Q2152049) (← links)
- Constructive \(t\)-secure homomorphic secret sharing for low degree polynomials (Q2152064) (← links)
- A pairing-free signature scheme from correlation intractable hash function and strong Diffie-Hellman assumption (Q2152147) (← links)
- Encrypted SQL arithmetic functions processing for secure cloud database (Q2154066) (← links)
- Algebraic secret sharing using privacy homomorphisms for IoT-based healthcare systems (Q2160700) (← links)
- A survey on delegated computation (Q2163976) (← links)
- More efficient structure-preserving signatures -- or: bypassing the type-III lower bounds (Q2167723) (← links)
- Improved signature schemes for secure multi-party computation with certified inputs (Q2167761) (← links)
- Asymptotically quasi-optimal cryptography (Q2170004) (← links)
- CryptHOL: game-based proofs in higher-order logic (Q2175214) (← links)
- Privacy-preserving ridge regression on distributed data (Q2195358) (← links)
- Privacy preserving multi-party computation delegation for deep learning in cloud computing (Q2198099) (← links)
- Public key encryption with equality test from generic assumptions in the random oracle model (Q2215090) (← links)
- Homomorphically encrypted \(k\)-means on cloud-hosted servers with low client-side load (Q2218487) (← links)
- Quantum fully homomorphic encryption scheme for cloud privacy data based on quantum circuit (Q2239686) (← links)
- Fair signature exchange via delegation on ubiquitous networks (Q2256716) (← links)
- An implementation for a fast public-key cryptosystem (Q2277427) (← links)
- One-round secure fair meeting location determination based on homomorphic encryption (Q2282275) (← links)
- Semi-generic construction of public key encryption and identity-based encryption with equality test (Q2293058) (← links)
- An efficient ID-based cryptographic transformation model for extended chaotic-map-based cryptosystem (Q2318572) (← links)
- Conjugacy systems based on nonabelian factorization problems and their applications in cryptography (Q2336603) (← links)
- A pairing-based three-party authenticated encryption scheme without shared secrets (Q2337989) (← links)
- Formal security proofs with minimal fuss: implicit computational complexity at work (Q2343128) (← links)
- Cryptanalysis of a noncommutative key exchange protocol (Q2346714) (← links)
- Sharing DSS by the Chinese remainder theorem (Q2349622) (← links)
- IND-CCA secure encryption based on a Zheng-Seberry scheme (Q2349630) (← links)
- Message transmission for GH-public key cryptosystem (Q2349638) (← links)
- Dynamic threshold secret reconstruction and its application to the threshold cryptography (Q2353654) (← links)
- The design of dynamic access control scheme with user authentication (Q2365551) (← links)
- A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols (Q2368990) (← links)
- Finite field arithmetic using quasi-normal bases (Q2370646) (← links)
- Inverse problems of chaotic dynamics and statistical analysis in providing information security in communication systems and networks (Q2371742) (← links)
- Elliptic curve scalar multiplication algorithm using complementary recoding (Q2383732) (← links)
- Certificateless signature: a new security model and an improved generic construction (Q2383987) (← links)
- Security enhancement for digital signature schemes with fault tolerance in RSA (Q2384524) (← links)
- Threshold cryptography based on Asmuth-Bloom secret sharing (Q2384533) (← links)
- Prêt à voter with Paillier encryption (Q2389798) (← links)
- Analysis and design of a secure key exchange scheme (Q2390334) (← links)
- Acoustic cryptanalysis (Q2397444) (← links)
- Some homomorphic cryptosystems based on nonassociative structures (Q2399990) (← links)
