Secure Message Transmission by Public Discussion: A Brief Survey (Q3005585): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-20901-7_8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2230862395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotically Optimal Two-Round Perfectly Secure Message Transmission / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized privacy amplification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Privacy Amplification by Public Discussion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast consensus in networks of bounded degree. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Fault Tolerance and Secure Computation on Sparse Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfectly secure message transmission / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards Optimal and Efficient Perfectly Secure Message Transmission / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249650 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure Message Transmission with Small Public Discussion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully Polynomial Byzantine Agreement for <i>n</i> &gt; 3<i>t</i> Processors in <i>t</i> + 1 Rounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost-Everywhere Secure Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Expected Constant-Round Protocols for Byzantine Agreement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost Secure (1-Round, n-Channel) Message Transmission Scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: Truly Efficient 2-Round Perfectly Secure Message Transmission Scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Extractors for Bit‐Fixing Sources and Exposure‐Resilient Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Byzantine Generals Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reaching Agreement in the Presence of Faults / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient perfectly secure message transmission in synchronous networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Optimal Secure Message Transmission by Public Discussion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology – CRYPTO 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tolerating linear number of faults in networks of bounded degree / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 03:11, 4 July 2024

scientific article
Language Label Description Also known as
English
Secure Message Transmission by Public Discussion: A Brief Survey
scientific article

    Statements

    Secure Message Transmission by Public Discussion: A Brief Survey (English)
    0 references
    0 references
    0 references
    0 references
    8 June 2011
    0 references
    survey paper
    0 references
    0 references
    0 references

    Identifiers