Efficient Statistical Asynchronous Verifiable Secret Sharing with Optimal Resilience (Q4931669): 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-14496-7_7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1490335752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An almost-surely terminating polynomial protocol for asynchronous byzantine agreement with optimal resilience / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035736 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple and Efficient Perfectly-Secure Asynchronous MPC / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfectly-Secure MPC with Linear Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asynchronous secure computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asynchronous secure computations with optimal resilience (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast asynchronous Byzantine agreement with optimal resilience / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250770 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3374918 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfectly secure message transmission / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: The round complexity of verifiable secret sharing and secure multicast / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2707411 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the Round Complexity of VSS in Point-to-Point Networks / 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: The Round Complexity of Verifiable Secret Sharing Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Statistical Asynchronous Verifiable Secret Sharing with Optimal Resilience / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple and efficient asynchronous byzantine agreement with optimal resilience / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 06:19, 3 July 2024

scientific article; zbMATH DE number 5793700
Language Label Description Also known as
English
Efficient Statistical Asynchronous Verifiable Secret Sharing with Optimal Resilience
scientific article; zbMATH DE number 5793700

    Statements

    Efficient Statistical Asynchronous Verifiable Secret Sharing with Optimal Resilience (English)
    0 references
    0 references
    0 references
    0 references
    29 September 2010
    0 references

    Identifiers