What Security Can We Achieve Within 4 Rounds? (Q2827735): 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-319-44618-9_26 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2398239478 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimistic fair exchange of digital signatures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Security against covert adversaries: Efficient protocols for realistic adversaries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035733 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Use Bitcoin to Design Fair Protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3826476 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3325625 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How Fair is Your Protocol? / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Exact Round Complexity of Secure Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Composition of Zero-Knowledge Proof Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial Fairness in Secure Two-Party Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Black-Box Constructions of Protocols for Secure Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smooth projective hashing and two-message oblivious transfer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Non-interactive Secure Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology – CRYPTO 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4783725 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimally Fair Coin Toss / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768332 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Round-Optimal Black-Box Two-Party Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4434874 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035712 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Framework for Efficient and Composable Oblivious Transfer / rank
 
Normal rank
Property / cites work
 
Property / cites work: New notions of security / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:19, 12 July 2024

scientific article
Language Label Description Also known as
English
What Security Can We Achieve Within 4 Rounds?
scientific article

    Statements

    What Security Can We Achieve Within 4 Rounds? (English)
    0 references
    21 October 2016
    0 references
    secure computation
    0 references
    coin-tossing
    0 references
    oblivious transfer
    0 references
    round complexity
    0 references

    Identifiers