Pages that link to "Item:Q2816444"
From MaRDI portal
The following pages link to Secure communications over insecure channels (Q2816444):
Displayed 50 items.
- Limits on the usefulness of random oracles (Q290382) (← links)
- Magnifying computing gaps. Establishing encrypted communication over unidirectional channels (Q290516) (← links)
- Cryptographic transformations of non-Shannon sources of information (Q466350) (← links)
- A rational framework for secure communication (Q497644) (← links)
- A simple model of secure public communication (Q836045) (← links)
- Masking traveling beams: optical solutions for NP-complete problems, trading space for time (Q847661) (← links)
- Quantum cryptography beyond quantum key distribution (Q908054) (← links)
- A nonlinear public key cryptosystem (Q1102923) (← links)
- The dining cryptographers problem: Unconditional sender and recipient untraceability (Q1109008) (← links)
- A time-luck tradeoff in relativized cryptography (Q1171879) (← links)
- Cryptology: The mathematics of secure communication (Q1259538) (← links)
- Perfectly secure key distribution for dynamic conferences (Q1273875) (← links)
- Fine-grained secure computation (Q1631318) (← links)
- A resource-competitive jamming defense (Q2075623) (← links)
- Fine-grained secure attribute-based encryption (Q2139633) (← links)
- Non-interactive zero-knowledge proofs with fine-grained security (Q2170050) (← links)
- On building fine-grained one-way functions from strong average-case hardness (Q2170063) (← links)
- Key establishment à la Merkle in a quantum world (Q2318085) (← links)
- Conjugacy systems based on nonabelian factorization problems and their applications in cryptography (Q2336603) (← links)
- ID-based cryptography using symmetric primitives (Q2384045) (← links)
- Merkle's key agreement protocol is optimal: an \(O(n^2)\) attack on any key agreement from random oracles (Q2408585) (← links)
- Algebraic generalization of Diffie-Hellman key exchange (Q2413287) (← links)
- Simple analysis of security of the BB84 quantum key distribution protocol (Q2677238) (← links)
- Plactic key agreement (insecure?) (Q2689206) (← links)
- Distributed Merkle's puzzles (Q2697863) (← links)
- Fine-Grained Cryptography (Q2829959) (← links)
- Computationally efficient algorithms for a one-time pad scheme (Q3038660) (← links)
- Weak Oblivious Transfer from Strong One-Way Functions (Q3092347) (← links)
- Towards a security model for computational puzzle schemes (Q3101621) (← links)
- On the method of puzzles for key distribution (Q3342452) (← links)
- Quantum computation and quantum information† (Q3375535) (← links)
- Deciphering an Undergraduate Cryptology Course (Q3583511) (← links)
- (Q4637977) (← links)
- A Simple Protocol for Signing Contracts (Q5019324) (← links)
- GENERALIZED RSA CIPHER AND DIFFIE-HELLMAN PROTOCOL (Q5020309) (← links)
- The Complexity of Public-Key Cryptography (Q5021130) (← links)
- On the Communication Complexity of Key-Agreement Protocols. (Q5090417) (← links)
- (Q5152110) (← links)
- FRACTAL MAGMAS AND PUBLIC-KEY CRYPTOGRAPHY (Q5152115) (← links)
- Basing Weak Public-Key Cryptography on Strong One-Way Functions (Q5445498) (← links)
- Combinatorial Design of Key Distribution Mechanisms for Wireless Sensor Networks (Q5862313) (← links)
- Fine-grained cryptography revisited (Q5918348) (← links)
- Cryptologists should not ignore the history of Al-Andalusia (Q6057201) (← links)
- Multiplication polynomials for elliptic curves over finite local rings (Q6060392) (← links)
- Verifiable capacity-bound functions: a new primitive from Kolmogorov complexity. (Revisiting space-based security in the adaptive setting) (Q6067351) (← links)
- A key agreement protocol based on group actions (Q6087703) (← links)
- Fine-grained non-interactive key-exchange: constructions and lower bounds (Q6138079) (← links)
- Shor's Factoring Algorithm and Modular Exponentiation Operators (Q6143096) (← links)
- Lower bound on SNARGs in the random oracle model (Q6163944) (← links)
- Anonymous whistleblowing over authenticated channels (Q6169427) (← links)