On the Communication Complexity of Key-Agreement Protocols. (Q5090417): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
(4 intermediate revisions by 4 users not shown) | |||
label / en | label / en | ||
On the Communication Complexity of Key-Agreement Protocols. | |||
Property / DOI | |||
Property / DOI: 10.4230/LIPIcs.ITCS.2019.40 / rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4526993 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Merkle Puzzles Are Optimal — An O(n2)-Query Attack on Any Key Exchange from a Random Oracle / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Zero-One Law for Boolean Privacy / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: New directions in cryptography / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Exponential Separation of Information and Communication for Boolean Functions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Limits on the usefulness of random oracles / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5750403 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Limits of random oracles in secure computation / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Secure communications over insecure channels / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4612484 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the distributional complexity of disjointness / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A method for obtaining digital signatures and public-key cryptosystems / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2914109078 / rank | |||
Normal rank | |||
Property / title | |||
On the Communication Complexity of Key-Agreement Protocols. (English) | |||
Property / title: On the Communication Complexity of Key-Agreement Protocols. (English) / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.4230/LIPICS.ITCS.2019.40 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 15:53, 30 December 2024
scientific article; zbMATH DE number 7559083
Language | Label | Description | Also known as |
---|---|---|---|
English | On the Communication Complexity of Key-Agreement Protocols. |
scientific article; zbMATH DE number 7559083 |
Statements
18 July 2022
0 references
key agreement
0 references
random oracle
0 references
communication complexity
0 references
Merkle's puzzles
0 references
0 references
On the Communication Complexity of Key-Agreement Protocols. (English)
0 references