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

Discrete Applied Mathematics

Secure multi-party computation made simple

MaurerUeli

Published Feb 1, 2006• 5 citations
Publisher

Abstract

Known secure multi-party computation protocols are quite complex, involving non-trivial mathematical structures and sub-protocols. The purpose of this paper is to present a very simple approach to ...
DOI
10.5555/1167813.1705201

Related papers

Secure Multi-party Computation Made Simple

Ueli M. Maurer

Lecture notes in computer science•Jan 1, 2003•59 citations

Secure Multi-Party Computation Made Simple

Ueli M. Maurer

•Jan 1, 2002•0 citations

Secure multi-party computation made simple

Ueli M. Maurer

Discrete Applied Mathematics•Oct 4, 2005•114 citations

Advances in Key Techniques of Practical Secure Multi-Party Computation

Han Jiang, Qiuliang Xu

Journal of Computer Research and Development•Oct 1, 2015•2 citations

Unconditionally secure Oblivious Polynomial Evaluation protocol

Li Luyao, Duan Zongtao, Wang Qinglong +2 more

Oblivious polynomial evaluation is a protocol involving two parties: a sender whose input is a polynomial and a receiver whose input is a value a .Most of existing Oblivious Polynomial Evaluation protocols were built based on some cryptographically intractable problems which made them a higher computation complexity.By using some random and hiding secure information in them, this paper presents an unconditionally secure oblivious polynomial evaluation protocol.It does not rely on any cryptographic assumption and involves only simple computation.Further, our protocol does not include any third party and is more practice.

International Conference on Advanced ICT and Education (ICAICTE)•Jan 1, 2013•2 citations

Research and Application of Secure Multi-party Computation Protocols

Ke Chen

•Jan 1, 2003•2 citations
Oblivious polynomial evaluation is a protocol involving two parties: a sender whose input is a polynomial and a receiver whose input is a value a .Most of existing Oblivious Polynomial Evaluation protocols were built based on some cryptographically intractable problems which made them a higher computation complexity.By using some random and hiding secure information in them, this paper presents an unconditionally secure oblivious polynomial evaluation protocol.It does not rely on any cryptographic assumption and involves only simple computation.Further, our protocol does not include any third party and is more practice.