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

Unconditionally Secure Computation with Reduced Interaction

Ivan Damgård, Jesper Buus Nielsen, Rafail Ostrovsky, Adi Rosén

Published Jan 1, 2016• 13 citations
Publisher
DOI
10.1007/978-3-662-49896-5_15

Related papers

Unconditionally Secure Computation Against Low-Complexity Leakage

Andrej Bogdanov, Yuval Ishai, Akshayaram Srinivasan

Journal of Cryptology•Aug 9, 2021•6 citations

Unconditionally Secure Computation Against Low-Complexity Leakage

Andrej Bogdanov, Yuval Ishai, Akshayaram Srinivasan

Lecture notes in computer science•Jan 1, 2019•18 citations

Asynchronous Unconditionally Secure Computation: An Efficiency Improvement

B. Prabhu, Kannan Srinathan, Chandrasekharan Pandu Rangan

Lecture notes in computer science•Jan 1, 2002•16 citations

Scalable and Unconditionally Secure Multiparty Computation

Ivan Damgård, Jesper Buus Nielsen

Springer eBooks•Aug 9, 2007•287 citations

Unconditionally Secure Multiparty Computation from Noisy Resources

Stefan Wolf, Jürg Wullschleger

Springer eBooks•Jan 1, 2007•1 citation

Unconditionally secure conference key distribution: Security definitions and their relations

Reihaneh Safavi–Naini, Shaoquan Jiang

A non-interactive conference key distribution scheme (NICKDS) is a system that allows selected sets of users to securely share a common key without interacting with each other. In this paper, we consider unconditionally secure setting where the is no limit on adversary's computation power. Unconditionally secure NICKDS has been considered with security against an adversary who can corrupt up to w users. We strengthen the security model of the system by allowing the adversary to also obtain conference keys of conferences whose members are honest, and use a game bases approach to define security. We give two other ways of defining security, using probability distance and mutual information and show the relationship between the three definitions of security.

Allerton Conference on Communication, Control, and Computing•Sep 1, 2008•0 citations
A non-interactive conference key distribution scheme (NICKDS) is a system that allows selected sets of users to securely share a common key without interacting with each other. In this paper, we consider unconditionally secure setting where the is no limit on adversary's computation power. Unconditionally secure NICKDS has been considered with security against an adversary who can corrupt up to w users. We strengthen the security model of the system by allowing the adversary to also obtain conference keys of conferences whose members are honest, and use a game bases approach to define security. We give two other ways of defining security, using probability distance and mutual information and show the relationship between the three definitions of security.