On the Necessity of Rewinding in Secure Multiparty Computation

DOI10.1007/978-3-540-70936-7_9MaRDI QIDQ3596378zbMATH OpenOpenAlexFDO

Authors Michael Backes, Joern Mueller-Quade, Dominique Unruh

Publication date 30 August 2007

Published in Theory of Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-70936-7_9

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• General composition and universal composability in secure multiparty computation
• Concurrently secure computation in constant rounds
• Information-theoretically secure protocols and security under composition
• Bounded-concurrent secure two-party computation without setup assumptions
• Information-theoretically secure protocols and security under composition

Cited in

(2)

• On the power of rewinding simulators in functional encryption
• On concurrently secure computation in the multiple ideal query model

This page was built for publication: On the Necessity of Rewinding in Secure Multiparty Computation

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