New directions in cryptography
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Short fail-stop signature scheme based on factorization and discrete logarithm assumptions
- An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation
- An improved identity-based key agreement protocol and its security proof
- The ring authenticated encryption scheme-how to provide a clue wisely
- Aitken and Neville inverse interpolation methods for the Lucas logarithm problem
- Elliptic curve based hardware architecture using cellular automata
- Quasi-quadratic elliptic curve point counting using rigid cohomology
- The twin Diffie-Hellman problem and applications
- New approaches for deniable authentication
- A secure and scalable group key exchange system
- Self-certified multi-proxy signature schemes with message recovery
- Probabilistic encryption
- Transaction protection by beacons
- Trapdoor knapsacks without superincreasing structure
- An application of factoring
- On a public-key cryptosystem based on iterated morphisms and substitutions
- A nonlinear public key cryptosystem
- Partial information in public key cryptography
- The dining cryptographers problem: Unconditional sender and recipient untraceability
- Minimum disclosure proofs of knowledge
- A key distribution system equivalent to factoring
- Hyperelliptic cryptosystems
- Univariate polynomial factorization over finite fields
- A cryptographic system based on finite field transforms
- A cryptosystem for multiple communication
- A note on a signature system based on probabilistic logic
- Uniform complexity and digital signatures
- Über die mathematischen Grundlagen einiger Chiffrierverfahren
- On computing logarithms over GF(2**p)
- A time-luck tradeoff in relativized cryptography
- Computation of discrete logarithms in prime fields
- On polynomial-time Turing and many-one completeness in PSPACE
- A note on cyclic groups, finite fields, and the discrete logarithm problem
- Protocols for group oriented secret sharing
- How hard is it to control an election?
- Arithmetic operations in \(GF(2^ m)\)
- Secure information storage and retrieval using new results in cryptography
- Cryptology: The mathematics of secure communication
- Password authentication using public-key cryptography
- Cryptography and elliptic curves
- Perfectly secure key distribution for dynamic conferences
- A calculus for cryptographic protocols: The spi calculus
- Synthesizers and their application to the parallel construction of pseudo-random functions
- Distributed games
- Creating strong, total, commutative, associative one-way functions from any one-way function in complexity theory
- A design of fast pipelined modular multiplier based on a diminished-radix algorithm
- Elliptic curve cryptosystems and their implementation
- Trace-orthogonal normal bases
- An authentication-combined access control scheme using a one-way function
- A key-exchange protocol using real quadratic fields
- Conducting secret ballot elections in computer networks: Problems and solutions
- Can Montgomery parasites be avoided? A design methodology based on key and cryptosystem modifications
- Integrating authentication in public key distribution system
- Authenticated encryption schemes with message linkage
- Speeding up the computations of elliptic curves cryptoschemes
- Batch RSA
- Batch Diffie-Hellman key agreement systems
- Linking information reconciliation and privacy amplification
- Carryless addition
- On the existence of statistically hiding bit commitment schemes and fail-stop signatures
- Equivalences between elliptic curves and real quadratic congruence function fields
- Improvement of modified authenticated key agreement protocol
- A new key authentication scheme based on discrete logarithms
- Multi-party key agreement protocols with cheater identification
- Improved authenticated multiple-key agreement protocol without using conventional one-way function.
- Multiparty authentication services and key agreement protocols with semi-trusted third party.
- Fast direct computation of modular reduction
- Input-trees of finite automata and application to cryptanalysis
- New efficient and secure protocols for verifiable signature sharing and other applications
- Small generic hardcore subsets for the discrete logarithm: short secret DL-keys.
- Pairing-based cryptography on elliptic curves
- Lattice-based key exchange on small integer solution problem
- On the existence of primitive completely normal bases of finite fields
- An efficient and secure searchable public key encryption scheme with privacy protection for cloud storage
- Two-round MPC: information-theoretic and black-box
- Certifying trapdoor permutations, revisited
- On the security loss of unique signatures
- Registration-based encryption: removing private-key generator from IBE
- On the hardness of the computational ring-LWR problem and its applications
- Cryptanalysis and design of a three-party authenticated key exchange protocol using smart card
- On the gold standard for security of universal steganography
- Revocable hierarchical identity-based encryption with shorter private keys and update keys
- Cryptanalysis of a combinatorial public key cryptosystem
- Quantum key agreement protocols with single photon in both polarization and spatial-mode degrees of freedom
- On the leakage-resilient key exchange
- How to simulate it in Isabelle: towards formal proof for secure multi-party computation
- Self-bilinear map on unknown order groups from indistinguishability obfuscation and its applications
- A note on the relation between categories and hyperstructures
- An active attack on a distributed group key exchange system
- Shorter quasi-adaptive NIZK proofs for linear subspaces
- Cryptanalysis of a multiparty quantum key agreement protocol based on commutative encryption
- CSIDH: an efficient post-quantum commutative group action
- Public key compression for constrained linear signature schemes
- Parallel algorithms for modular multi-exponentiation
- Multiparty quantum key agreement with four-qubit symmetric W state
- Necessary conditions for power commuting in finite-dimensional algebras over a field
- Cryptanalysis of a key exchange protocol based on the ring \(E_p^{(m)}\)
- Deterministic MDI QKD with two secret bits per shared entangled pair
- How to (pre-)compute a ladder -- improving the performance of X25519 and X448
- A provable authenticated group key agreement protocol for mobile environment
This page was built for publication: New directions in cryptography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3875826)
