Secure communications over insecure channels

From MaRDI portal
Revision as of 17:58, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2816444

DOI10.1145/359460.359473zbMath1342.94085OpenAlexW2047925852WikidataQ55878785 ScholiaQ55878785MaRDI QIDQ2816444

Ralph C. Merkle

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 oraclesMagnifying computing gaps. Establishing encrypted communication over unidirectional channelsA simple model of secure public communicationFine-grained secure computationFine-grained secure attribute-based encryptionMasking traveling beams: optical solutions for NP-complete problems, trading space for timeID-based cryptography using symmetric primitivesA nonlinear public key cryptosystemThe dining cryptographers problem: Unconditional sender and recipient untraceabilityNon-interactive zero-knowledge proofs with fine-grained securityOn building fine-grained one-way functions from strong average-case hardnessMerkle's key agreement protocol is optimal: an \(O(n^2)\) attack on any key agreement from random oraclesGENERALIZED RSA CIPHER AND DIFFIE-HELLMAN PROTOCOLAlgebraic generalization of Diffie-Hellman key exchangeSimple analysis of security of the BB84 quantum key distribution protocolCryptologists should not ignore the history of Al-AndalusiaMultiplication polynomials for elliptic curves over finite local ringsVerifiable capacity-bound functions: a new primitive from Kolmogorov complexity. (Revisiting space-based security in the adaptive setting)A key agreement protocol based on group actionsFine-grained non-interactive key-exchange: constructions and lower boundsShor's Factoring Algorithm and Modular Exponentiation OperatorsLower bound on SNARGs in the random oracle modelAnonymous whistleblowing over authenticated channelsPlactic key agreement (insecure?)Quantum cryptography beyond quantum key distributionDistributed Merkle's puzzlesCryptographic transformations of non-Shannon sources of informationA time-luck tradeoff in relativized cryptographyA rational framework for secure communicationFRACTAL MAGMAS AND PUBLIC-KEY CRYPTOGRAPHYDeciphering an Undergraduate Cryptology CourseComputationally efficient algorithms for a one-time pad schemeOn the method of puzzles for key distributionFine-grained secure attribute-based encryptionBasing Weak Public-Key Cryptography on Strong One-Way FunctionsFine-grained cryptography revisitedQuantum computation and quantum information†Cryptology: The mathematics of secure communicationWeak Oblivious Transfer from Strong One-Way FunctionsOn the Communication Complexity of Key-Agreement Protocols.Perfectly secure key distribution for dynamic conferencesFine-Grained CryptographyTowards a security model for computational puzzle schemesKey establishment à la Merkle in a quantum worldA resource-competitive jamming defenseUnnamed ItemConjugacy systems based on nonabelian factorization problems and their applications in cryptographyCombinatorial Design of Key Distribution Mechanisms for Wireless Sensor NetworksUnnamed ItemA Simple Protocol for Signing ContractsThe Complexity of Public-Key Cryptography







This page was built for publication: Secure communications over insecure channels