An equational approach to secure multi-party computation

DOI10.1145/2422436.2422478MaRDI QIDQ2986886zbMATH OpenOpenAlexFDO

Authors Daniele Micciancio, Stefano Tessaro

Publication date 16 May 2017

Published in Proceedings of the 4th conference on Innovations in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2422436.2422478

zbMATH Keywords

cryptographymulti-party computationuniversal composability

Mathematics Subject Classification ID

Network protocols (68M12) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• scientific article; zbMATH DE number 1583776
• Secure multiparty computation of approximations
• Secure multi-party computation
• scientific article; zbMATH DE number 1754645
• Secure Multiparty Computation
• Applying secure multi-party computation in practice
• An Efficient Framework for Unconditionally Secure Multiparty Computation
• Multiparty Computation from Somewhat Homomorphic Encryption
• Secure multiparty computation and secret sharing

Cites work

• A model of interactive teaching
• A theory of goal-oriented communication
• A theory of the learnable
• Algorithmic Learning Theory
• Derandomizing polynomial identity tests means proving circuit lower bounds
• scientific article; zbMATH DE number 3154781 (Why is no real title available?)
• scientific article; zbMATH DE number 67625 (Why is no real title available?)
• scientific article; zbMATH DE number 67631 (Why is no real title available?)
• scientific article; zbMATH DE number 1559537 (Why is no real title available?)
• In search of an easy witness: Exponential time vs. probabilistic polynomial time.
• Learning from different teachers
• Measuring teachability using variants of the teaching dimension
• Models of cooperative teaching and learning
• Occam's razor
• On specifying Boolean functions by labelled examples
• On the complexity of teaching
• On the limits of efficient teachability
• On the power of inductive inference from good examples
• Pseudorandom generators for space-bounded computation
• Recent Developments in Algorithmic Teaching
• Teachability in computational learning
• Teaching a smarter learner.
• Teaching Randomized Learners

Cited in

(14)

• Short variable length domain extenders with beyond birthday bound security
• How to simulate it in Isabelle: towards formal proof for secure multi-party computation
• State separation for code-based game-playing proofs
• Toward an algebraic theory of systems
• A note on secure multiparty computation via higher residue symbols
• CryptHOL: game-based proofs in higher-order logic
• Adaptive security of multi-party protocols, revisited
• Computationally sound abstraction and verification of secure multi-party computations
• Systematizing secure computation for research and decision support
• A Multi-Party Protocol for Privacy-Preserving Cooperative Linear Systems of Equations
• Compactness vs collusion resistance in functional encryption
• Categorical composable cryptography: extended version
• Categorical composable cryptography
• R3PO: reach-restricted reactive program obfuscation and its applications

Describes a project that uses

Uses Software

• GNUC
• FairplayMP

This page was built for publication: An equational approach to secure multi-party computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2986886)