Secure communications over insecure channels
From MaRDI portal
Publication:2816444
DOI10.1145/359460.359473zbMath1342.94085OpenAlexW2047925852WikidataQ55878785 ScholiaQ55878785MaRDI QIDQ2816444
Publication date: 22 August 2016
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/359460.359473
Related Items (51)
Limits on the usefulness of random oracles ⋮ Magnifying computing gaps. Establishing encrypted communication over unidirectional channels ⋮ A simple model of secure public communication ⋮ Fine-grained secure computation ⋮ Fine-grained secure attribute-based encryption ⋮ Masking traveling beams: optical solutions for NP-complete problems, trading space for time ⋮ ID-based cryptography using symmetric primitives ⋮ A nonlinear public key cryptosystem ⋮ The dining cryptographers problem: Unconditional sender and recipient untraceability ⋮ Non-interactive zero-knowledge proofs with fine-grained security ⋮ On building fine-grained one-way functions from strong average-case hardness ⋮ Merkle's key agreement protocol is optimal: an \(O(n^2)\) attack on any key agreement from random oracles ⋮ GENERALIZED RSA CIPHER AND DIFFIE-HELLMAN PROTOCOL ⋮ Algebraic generalization of Diffie-Hellman key exchange ⋮ Simple analysis of security of the BB84 quantum key distribution protocol ⋮ 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 ⋮ 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 ⋮ Plactic key agreement (insecure?) ⋮ Quantum cryptography beyond quantum key distribution ⋮ Distributed Merkle's puzzles ⋮ Cryptographic transformations of non-Shannon sources of information ⋮ A time-luck tradeoff in relativized cryptography ⋮ A rational framework for secure communication ⋮ FRACTAL MAGMAS AND PUBLIC-KEY CRYPTOGRAPHY ⋮ Deciphering an Undergraduate Cryptology Course ⋮ Computationally efficient algorithms for a one-time pad scheme ⋮ On the method of puzzles for key distribution ⋮ Fine-grained secure attribute-based encryption ⋮ Basing Weak Public-Key Cryptography on Strong One-Way Functions ⋮ Fine-grained cryptography revisited ⋮ Quantum computation and quantum information† ⋮ Cryptology: The mathematics of secure communication ⋮ Weak Oblivious Transfer from Strong One-Way Functions ⋮ On the Communication Complexity of Key-Agreement Protocols. ⋮ Perfectly secure key distribution for dynamic conferences ⋮ Fine-Grained Cryptography ⋮ Towards a security model for computational puzzle schemes ⋮ Key establishment à la Merkle in a quantum world ⋮ A resource-competitive jamming defense ⋮ Unnamed Item ⋮ Conjugacy systems based on nonabelian factorization problems and their applications in cryptography ⋮ Combinatorial Design of Key Distribution Mechanisms for Wireless Sensor Networks ⋮ Unnamed Item ⋮ A Simple Protocol for Signing Contracts ⋮ The Complexity of Public-Key Cryptography
This page was built for publication: Secure communications over insecure channels