Information-theoretically secure protocols and security under composition

DOI10.1137/090755886MaRDI QIDQ3053161zbMATH OpenOpenAlexFDO

Authors Eyal Kushilevitz, Yehuda Lindell, Tal Rabin

Publication date 4 November 2010

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/090755886

zbMATH Keywords

information-theoretic securitytheory of cryptographysecurity under composition

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Information-theoretically secure protocols and security under composition
• General composition and universal composability in secure multiparty computation
• Secure composition of cryptographic protocols. (Abstract)
• Security and composition of multiparty cryptographic protocols
• Safely composing security protocols

Cited in

(18)

• On the Necessity of Rewinding in Secure Multiparty Computation
• Security in Asynchronous Interactive Systems
• Efficient perfectly secure computation with optimal resilience
• Efficient perfectly secure computation with optimal resilience
• High-throughput secure three-party computation for malicious adversaries and an honest majority
• scientific article; zbMATH DE number 5225572 (Why is no real title available?)
• Actively secure arithmetic computation and VOLE with constant computational overhead
• Perfect MPC over layered graphs
• A full proof of the BGW protocol for perfectly secure multiparty computation
• Fast large-scale honest-majority MPC for malicious adversaries
• Secure multi-party computation in large networks
• Information-Theoretic Security of Cryptographic Channels
• On constant-round concurrent zero-knowledge from a knowledge assumption
• High-throughput secure three-party computation with an honest majority
• Efficient two-party exponentiation from quotient transfer
• Threshold fully homomorphic encryption over the torus
• scientific article; zbMATH DE number 1418286 (Why is no real title available?)
• Information-theoretically secure protocols and security under composition

This page was built for publication: Information-theoretically secure protocols and security under composition

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