Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Universally Composable Secure Computation with Corrupted Tokens

Nishanth Chandran, Wutichai Chongchitmate, Rafail Ostrovsky, Ivan Visconti

Published Jan 1, 2019• 6 citations
Publisher
DOI
10.1007/978-3-030-26954-8_14

Related papers

Universally Composable Secure Two and Multi-party Computation in the Corruptible Tamper-Proof Hardware Token Model

Nishanth Chandran, Wutichai Chongchitmate, Rafail Ostrovsky +1 more

International Cryptology Conference•Jan 1, 2017•2 citations

Universally Composable Secure Computation with (Malicious) Physically Uncloneable Functions

Rafail Ostrovsky, Alessandra Scafuro, Ivan Visconti +1 more

Lecture notes in computer science•Jan 1, 2013•61 citations

Adaptively Secure, Universally Composable, Multiparty Computation in Constant Rounds

Dana Dachman-Soled, Jonathan I. Katz, Vanishree Rao

Lecture notes in computer science•Jan 1, 2015•44 citations

A Simpler Variant of Universally Composable Security for Standard Multiparty Computation

Ran Canetti, Asaf Cohen, Yehuda Lindell

Lecture notes in computer science•Jan 1, 2015•91 citations

(Efficient) Universally Composable Two-Party Computation Using a Minimal Number of Stateless Tokens.

Seung Geol Choi, Jonathan I. Katz, Dominique Schröder +2 more

•Jan 1, 2011•4 citations

Unconditional and Composable Security Using a Single Stateful Tamper-Proof Hardware Token

Nico Döttling, Daniel Kraschewski, Jörn Müller‐Quade

Lecture notes in computer science•Jan 1, 2011•52 citations