Universal composability from essentially any trusted setup

DOI10.1007/978-3-642-32009-5_24MaRDI QIDQ2914272zbMATH OpenOpenAlexFDO

Authors Mike Rosulek

Publication date 25 September 2012

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-32009-5_24

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Distributing the setup in universally composable multi-party computation
• New notions of security: achieving universal composability without trusted setup
• A zero-one law for cryptographic complexity with respect to computational UC security
• Universally Composable Multi-party Computation Using Tamper-Proof Hardware
• On the limitations of universally composable two-party computation without set-up assumptions

Cited in

(8)

• On the structure of unconditional UC hybrid protocols
• Distributing the setup in universally composable multi-party computation
• Bringing people of different beliefs together to do UC
• New notions of security: achieving universal composability without trusted setup
• A zero-one law for cryptographic complexity with respect to computational UC security
• Universally Composable Security with Global Setup
• Long-term security and universal composability
• Functional commitments for all functions, with transparent setup and from SIS

This page was built for publication: Universal composability from essentially any trusted setup

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