Secure communications over insecure channels
From MaRDI portal
Recommendations
Cited in
(88)- A nonlinear public key cryptosystem
- The dining cryptographers problem: Unconditional sender and recipient untraceability
- A time-luck tradeoff in relativized cryptography
- Cryptology: The mathematics of secure communication
- Secure protocols of how communication generates correlation
- Perfectly secure key distribution for dynamic conferences
- Fine-grained secure computation
- A resource-competitive jamming defense
- Fine-grained secure attribute-based encryption
- Non-interactive zero-knowledge proofs with fine-grained security
- On building fine-grained one-way functions from strong average-case hardness
- Key establishment à la Merkle in a quantum world
- Conjugacy systems based on nonabelian factorization problems and their applications in cryptography
- ID-based cryptography using symmetric primitives
- Merkle's key agreement protocol is optimal: an \(O(n^2)\) attack on any key agreement from random oracles
- Algebraic generalization of Diffie-Hellman key exchange
- Secure communications with strange planet protocol
- Simple analysis of security of the BB84 quantum key distribution protocol
- Plactic key agreement (insecure?)
- Distributed Merkle's puzzles
- The Impossibility of Keyless Communication in Quantum Cryptography
- Unconventional cryptographic keying variable management
- Fine-Grained Cryptography
- Dynamic Secrets in Communication Security
- Limits on the usefulness of random oracles
- Magnifying computing gaps. Establishing encrypted communication over unidirectional channels
- Physical-layer encryption communication systems with block ciphers
- A prototype encryption system using public key
- Computationally efficient algorithms for a one-time pad scheme
- Weak oblivious transfer from strong one-way functions
- Towards a security model for computational puzzle schemes
- On the method of puzzles for key distribution
- Quantum computation and quantum information†
- Establishment of the secure channel between broker nodes in pub/sub system
- Deciphering an Undergraduate Cryptology Course
- On the Use of the Binary Multiplying Channel in a Private Communication System
- New directions in cryptography
- scientific article; zbMATH DE number 3685395 (Why is no real title available?)
- scientific article; zbMATH DE number 546875 (Why is no real title available?)
- scientific article; zbMATH DE number 549857 (Why is no real title available?)
- scientific article; zbMATH DE number 1947519 (Why is no real title available?)
- scientific article; zbMATH DE number 2011839 (Why is no real title available?)
- scientific article; zbMATH DE number 1504781 (Why is no real title available?)
- Provably secure key establishment against quantum adversaries
- Cryptographic transformations of non-Shannon sources of information
- On an approach to the construction of secure connections
- A rational framework for secure communication
- A simple protocol for signing contracts
- Generalized RSA cipher and Diffie-Hellman protocol
- The Complexity of Public-Key Cryptography
- On the Communication Complexity of Key-Agreement Protocols.
- scientific article; zbMATH DE number 7312512 (Why is no real title available?)
- Fractal magmas and public-key cryptography
- Secure information transmission based on physical principles
- Advances in Cryptology – CRYPTO 2004
- The Role of Feedback in Two-Way Secure Communications
- Basing Weak Public-Key Cryptography on Strong One-Way Functions
- Combinatorial design of key distribution mechanisms for wireless sensor networks
- Fine-grained cryptography revisited
- Cryptologists should not ignore the history of Al-Andalusia
- Multiplication polynomials for elliptic curves over finite local rings
- Verifiable capacity-bound functions: a new primitive from Kolmogorov complexity. (Revisiting space-based security in the adaptive setting)
- A key agreement protocol based on group actions
- INFORMATION THEORETICALLY SECURE KEY EXCHANGE ALGORITHM
- Fine-grained non-interactive key-exchange: constructions and lower bounds
- Shor's Factoring Algorithm and Modular Exponentiation Operators
- Lower bound on SNARGs in the random oracle model
- Anonymous whistleblowing over authenticated channels
- Fine-grained secure attribute-based encryption
- Cryptography from planted graphs: security with logarithmic-size messages
- Communication lower bounds of key-agreement protocols via density increment arguments
- Fine-grained polynomial functional encryption
- Fine-grained non-interactive key-exchange without idealized assumptions
- Fine-grained non-interactive key exchange, revisited
- On building fine-grained one-way functions from strong average-case hardness
- Protocols for quantum weak coin flipping
- Spectral approach to the communication complexity of multi-party key agreement
- On bounded storage key agreement and one-way functions
- How much is in a square? Calculating functional programs with squares
- Truncated modular exponentiation operators: a strategy for quantum factoring
- Lower bounds on inner-product functional encryption from all-or-nothing encryption primitives
- Key-agreement with perfect completeness from random oracles
- Efficient quantum pseudorandomness from Hamiltonian phase states
- Blockchain frontiers in statistics
- The planted orthogonal vectors problem
- A simple model of secure public communication
- Masking traveling beams: optical solutions for NP-complete problems, trading space for time
- Quantum cryptography beyond quantum key distribution
This page was built for publication: Secure communications over insecure channels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2816444)
