On the Exact Round Complexity of Self-composable Two-Party Computation (Q5738974): 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-56614-6_7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2592566690 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4434869 / 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: Zaps and Their Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3210166 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concurrently Secure Computation in Constant Rounds / 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 Concurrently Secure Computation in the Multiple Ideal Query Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Textbook non-malleable commitments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lossy Encryption: Constructions from General Assumptions and Efficient Selective Opening Chosen Ciphertext Security / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology – CRYPTO 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Round-Efficient Black-Box Construction of Composable Multi-Party Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant-Round Black-Box Construction of Composable Multi-Party Computation Protocol / rank
 
Normal rank
Property / cites work
 
Property / cites work: Publicly Verifiable Non-Interactive Zero-Knowledge Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-malleability amplification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Black-Box Constructions of Composable Protocols without Set-Up / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified framework for concurrent security / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded-concurrent secure two-party computation without setup assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of security of Yao's protocol for two-party computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / 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: Bounded-concurrent secure multi-party computation with a dishonest majority / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Unified Framework for UC from Only OT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lossy trapdoor functions and their applications / 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 23:45, 13 July 2024

scientific article; zbMATH DE number 6729783
Language Label Description Also known as
English
On the Exact Round Complexity of Self-composable Two-Party Computation
scientific article; zbMATH DE number 6729783

    Statements

    On the Exact Round Complexity of Self-composable Two-Party Computation (English)
    0 references
    0 references
    0 references
    0 references
    13 June 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers