Near-Linear Unconditionally-Secure Multiparty Computation With a Dishonest Minority

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-32009-5_39
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Protocols for Multiparty Coin Toss With a Dishonest Majority

Journal of Cryptology
Applied MathematicsComputer Science ApplicationsSoftware
2013English

Secure Multiparty Computation and Trusted Hardware: Examining Adoption Challenges and Opportunities

Security and Communication Networks
Computer NetworksInformation SystemsCommunications
2019English

Unconditionally-Secure Digital Signatures

English

Unconditional Byzantine Agreement and Multi-Party Computation Secure Against Dishonest Minorities From Scratch

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2002English

On the Orthogonal Vector Problem and the Feasibility of Unconditionally Secure Leakage-Resilient Computation

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2015English

Secure Computation of Private Set Intersection Cardinality With Linear Complexity

Advances in Information Security, Privacy, and Ethics
2019English

Secure Dynamic Multiparty Quantum Private Comparison

Scientific Reports
Multidisciplinary
2019English

Verifiable Secure Computation of Linear Fractional Programming Using Certificate Validation

International Journal of Power Electronics and Drive Systems
Electronic EngineeringPower TechnologyElectricalEnergy Engineering
2020English

Secure Computation

English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy