Concurrent general composition of secure protocols in the timing model

DOI10.1145/1060590.1060687MaRDI QIDQ3581455zbMATH OpenOpenAlexFDO

Authors Yael Tauman Kalai, Yehuda Lindell, Manoj Prabhakaran

Publication date 16 August 2010

Published in Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1060590.1060687

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62) Network protocols (68M12)

Recommendations

• Concurrent composition of secure protocols in the timing model
• General composition and universal composability in secure multiparty computation
• Secure composition of cryptographic protocols. (Abstract)
• Universally composable synchronous computation
• Asynchronous secure multiparty computation in constant time

Cited in

(11)

• An efficient secure real-time concurrency control protocol
• Eye for an eye: efficient concurrent zero-knowledge in the timing model
• Simplex consensus: a simple and fast consensus protocol
• Impossibility results for universal composability in public-key models and with fixed inputs
• Constraints Solution for Time Sensitive Security Protocols
• Universally composable succinct vector commitments and applications
• Improved black-box constructions of composable secure computation
• TARDIS: a foundation of time-lock puzzles in UC
• Environmentally friendly composable multi-party computation in the plain model from standard (timed) assumptions
• Concurrent composition of secure protocols in the timing model
• Local Sequentiality Does Not Help for Concurrent Composition

This page was built for publication: Concurrent general composition of secure protocols in the timing model

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