The following pages link to New directions in cryptography (Q3875826):
Displaying 50 items.
- A new cryptosystem using generalized Mersenne primes (Q258874) (← links)
- On the security of two identity-based signature schemes based on pairings (Q264198) (← links)
- Efficient multi-party quantum key agreement by cluster states (Q265402) (← links)
- Participant attack on three-party quantum key agreement with two-photon entanglement (Q267227) (← links)
- Efficient set intersection with simulation-based security (Q271588) (← links)
- The space complexity analysis in the general number field sieve integer factorization (Q278727) (← links)
- A conference key distribution system for the star configuration based on the discrete logarithm problem (Q287059) (← links)
- Automata evaluation and text search protocols with simulation-based security (Q290379) (← links)
- An observation on associative one-way functions in complexity theory (Q293135) (← links)
- Multi-party quantum key agreement by an entangled six-qubit state (Q294000) (← links)
- Efficient multiparty quantum key agreement protocol based on commutative encryption (Q296136) (← links)
- Unconditionally secure quantum signatures (Q296340) (← links)
- NSA and dual EC\(\_\)DRBG: Déjà vu all over again? (Q297495) (← links)
- A novel group key transfer for big data security (Q298626) (← links)
- A new two-round dynamic authenticated contributory group key agreement protocol using elliptic curve Diffie-Hellman with privacy preserving public key infrastructure (Q301801) (← links)
- A note on the distribution of self-dual normal bases generators of finite fields under trace map (Q304538) (← links)
- Classifying and generating exact coset representatives of \(\operatorname{PGL}_2(\mathbb{F}_q)\) in \(\operatorname{PGL}_2(\mathbb{F}_{q^2})\) (Q324277) (← links)
- Fault-tolerant quantum blind signature protocols against collective noise (Q332136) (← links)
- Cryptographic hardness of random local functions. Survey (Q332271) (← links)
- An improved secure and efficient password and chaos-based two-party key agreement protocol (Q332780) (← links)
- Authenticated commutator key agreement protocol (Q338834) (← links)
- Public key protocols over the ring \(E_{p}^{(m)}\) (Q340183) (← links)
- Revisiting structure graphs: applications to CBC-MAC and EMAC (Q350515) (← links)
- A chaotic maps-based authenticated key agreement protocol with strong anonymity (Q355005) (← links)
- An ID-based authenticated dynamic group key agreement with optimal round (Q362177) (← links)
- Round-optimal password-based authenticated key exchange (Q380962) (← links)
- How to achieve non-repudiation of origin with privacy protection in cloud computing (Q394727) (← links)
- An identity-based cryptographic model for discrete logarithm and integer factoring based cryptosystem (Q396599) (← links)
- The 2010 Benjamin Franklin Medal in Computer and Cognitive Science presented to Shafrira Goldwasser, Ph.D. (Q398324) (← links)
- Enhanced key-establishing rates and efficiencies in fiber laser key distribution systems (Q407957) (← links)
- An efficient collision detection method for computing discrete logarithms with Pollard's rho (Q411043) (← links)
- An improved two-party identity-based authenticated key agreement protocol using pairings (Q414861) (← links)
- Parallel modular exponentiation using load balancing without precomputation (Q414922) (← links)
- Two-server password-only authenticated key exchange (Q414937) (← links)
- A suite of algorithms for key distribution and authentication in centralized secure multicast environments (Q415239) (← links)
- A public key cryptosystem based on three new provable problems (Q418738) (← links)
- A lightweight anonymous routing protocol without public key en/decryptions for wireless ad hoc networks (Q424783) (← links)
- A round-optimal three-party ID-based authenticated key agreement protocol (Q425537) (← links)
- Security analysis of the public key algorithm based on Chebyshev polynomials over the integer ring \(Z_{N}\) (Q429602) (← links)
- Multi-verifier signatures (Q431790) (← links)
- Accelerating Pollard's rho algorithm on finite fields (Q431795) (← links)
- Discrete logarithm based additively homomorphic encryption and secure data aggregation (Q433021) (← links)
- Provably secure one-round identity-based authenticated asymmetric group key agreement protocol (Q433086) (← links)
- Computational indistinguishability between quantum states and its cryptographic application (Q434349) (← links)
- Security improvement on an anonymous key agreement protocol based on chaotic maps (Q434848) (← links)
- CMQV+: an authenticated key exchange protocol from CMQV (Q439860) (← links)
- Improved Pollard rho method for computing discrete logarithms over finite extension fields (Q442714) (← links)
- Short undeniable signatures based on group homomorphisms (Q451120) (← links)
- Group key agreement for secure group communication in dynamic peer systems (Q455985) (← links)
- An ID-based cryptographic mechanisms based on GDLP and IFP (Q456110) (← links)
