An equational approach to secure multi-party computation

DOI10.1145/2422436.2422478zbMath1362.68080OpenAlexW2024784309MaRDI QIDQ2986886

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

cryptographyuniversal composabilitymulti-party computation

Mathematics Subject Classification ID

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

Related Items (8)

Short variable length domain extenders with beyond birthday bound security ⋮ Compactness vs Collusion Resistance in Functional Encryption ⋮ CryptHOL: game-based proofs in higher-order logic ⋮ Categorical composable cryptography: extended version ⋮ Categorical composable cryptography ⋮ Adaptive security of multi-party protocols, revisited ⋮ State separation for code-based game-playing proofs ⋮ Toward an algebraic theory of systems

Uses Software

• FairplayMP
• GNUC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Teachability in computational learning
• Measuring teachability using variants of the teaching dimension
• Teaching a smarter learner.
• Occam's razor
• Pseudorandom generators for space-bounded computation
• On the power of inductive inference from good examples
• A model of interactive teaching
• Learning from different teachers
• On the limits of efficient teachability
• In search of an easy witness: Exponential time vs. probabilistic polynomial time.
• On the complexity of teaching
• On specifying Boolean functions by labelled examples
• Recent Developments in Algorithmic Teaching
• A theory of the learnable
• Teaching Randomized Learners
• Algorithmic Learning Theory
• A theory of goal-oriented communication
• Derandomizing polynomial identity tests means proving circuit lower bounds

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