OT-Combiners via Secure Computation (Q5445517): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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-540-78524-8_22 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1487501992 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228503 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527012 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oblivious transfer and privacy amplification / 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: Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure Computation from Random Error Correcting Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Zero-One Law for Boolean Privacy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3374918 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4343427 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scalable Secure Multiparty Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3787498 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How Many Oblivious Transfers Are Needed for Secure Multiparty Computation? / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Robust Combiners for Oblivious Transfer and Other Primitives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topics in Cryptology – CT-RSA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4783721 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5750403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - CRYPTO 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549593 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Robust Combiners for Private Information Retrieval and Other Primitives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robuster Combiners for Oblivious Transfer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error-Tolerant Combiners for Oblivious Primitives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3671875 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oblivious-Transfer Amplification / rank
 
Normal rank

Latest revision as of 18:19, 27 June 2024

scientific article; zbMATH DE number 5242865
Language Label Description Also known as
English
OT-Combiners via Secure Computation
scientific article; zbMATH DE number 5242865

    Statements

    OT-Combiners via Secure Computation (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    5 March 2008
    0 references

    Identifiers