Unconditional Byzantine agreement for any number of faulty processors (Q5096793): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4035678 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inversionless decoding of binary BCH codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dining cryptographers problem: Unconditional sender and recipient untraceability / rank
 
Normal rank
Property / cites work
 
Property / cites work: New directions in cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Authenticated Algorithms for Byzantine Agreement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4065548 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Codes Which Detect Deception / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks / 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: Probabilistic Algorithms in Finite Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: New hash functions and their use in authentication and set equality / rank
 
Normal rank

Latest revision as of 22:43, 29 July 2024

scientific article; zbMATH DE number 7573042
Language Label Description Also known as
English
Unconditional Byzantine agreement for any number of faulty processors
scientific article; zbMATH DE number 7573042

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references