What security can we achieve within 4 rounds? (Q2010586): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A new approach to round-optimal secure multiparty computation / 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: Semi-homomorphic Encryption and Multiparty Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035733 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Promise zero knowledge and its applications to round optimal MPC / rank
 
Normal rank
Property / cites work
 
Property / cites work: Round optimal concurrent MPC via strong simulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Four round secure computation without setup / 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: \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3826476 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Security and composition of multiparty cryptographic protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4940695 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3792628 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: From Weak to Strong Zero-Knowledge and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Round-optimal secure two-party computation from trapdoor permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiparty Computation from Somewhat Homomorphic Encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast distributed RSA key generation for semi-honest and malicious adversaries / rank
 
Normal rank
Property / cites work
 
Property / cites work: A public key cryptosystem and a signature scheme based on discrete logarithms / 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: 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: A “Paradoxical” Solution to The Signature Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-round multiparty secure computation from minimal assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-honest to Malicious Oblivious Transfer—The Black-Box Way / rank
 
Normal rank
Property / cites work
 
Property / cites work: Round-optimal secure multi-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 RSA Key Generation and Threshold Paillier in the Two-Party Setting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low cost constant round MPC combining BMR and 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: Zero-Knowledge Proofs from Secure Multiparty 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: A New Approach to Practical Active-Secure Two-Party Computation / 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: New notions of security / 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: Black-Box Constructions of Two-Party Protocols from One-Way Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to share a secret / rank
 
Normal rank

Latest revision as of 03:48, 21 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
    27 November 2019
    0 references
    0 references
    secure computation
    0 references
    coin-tossing
    0 references
    oblivious-transfer
    0 references
    round complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references