On concurrently secure computation in the multiple ideal query model

DOI10.1007/978-3-642-38348-9_40MaRDI QIDQ4924439zbMATH OpenOpenAlexFDO

Authors Vipul Goyal, Abhishek Jain

Publication date 31 May 2013

Published in Advances in cryptology -- EUROCRYPT 2013. 32nd annual international conference on the theory and applications of cryptographic techniques, Athens, Greece, May 26--30, 2013. Proceedings (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-38348-9_40

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Concurrent secure computation with optimal query complexity
• What Information Is Leaked under Concurrent Composition?
• Concurrently secure computation in constant rounds
• Bounded-concurrent secure multi-party computation with a dishonest majority
• On the Necessity of Rewinding in Secure Multiparty Computation

Cited in

(8)

• Concurrent secure computation via non-black box simulation
• Concurrent secure computation with optimal query complexity
• Concurrently composable security with shielded super-polynomial simulators
• On the exact round complexity of self-composable two-party computation
• On concurrent multi-party quantum computation
• Two-round concurrent 2PC from sub-exponential LWE
• Improved black-box constructions of composable secure computation
• Round-efficient composable two-party quantum computation

This page was built for publication: On concurrently secure computation in the multiple ideal query model

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