Information-Theoretically Secure Protocols and Security under Composition

DOI10.1137/090755886zbMath1202.94185OpenAlexW1977802313MaRDI QIDQ3053161

Tal Rabin, Yehuda Lindell, Eyal Kushilevitz

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)

Related Items (13)

Secure multi-party computation in large networks ⋮ On Constant-Round Concurrent Zero-Knowledge from a Knowledge Assumption ⋮ Actively secure arithmetic computation and VOLE with constant computational overhead ⋮ High-throughput secure three-party computation with an honest majority ⋮ Perfect MPC over layered graphs ⋮ Fast large-scale honest-majority MPC for malicious adversaries ⋮ A full proof of the BGW protocol for perfectly secure multiparty computation ⋮ High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority ⋮ Security in Asynchronous Interactive Systems ⋮ Threshold fully homomorphic encryption over the torus ⋮ Efficient perfectly secure computation with optimal resilience ⋮ Efficient perfectly secure computation with optimal resilience ⋮ Efficient two-party exponentiation from quotient transfer

This page was built for publication: Information-Theoretically Secure Protocols and Security under Composition