Wilton Kim, Van Long Phuoc Pham, Stanislav Kruglik, Han Mao Kiah · 2026 · arXiv
DOI: 10.48550/arXiv.2610.27609 · open-access PDF
CRYPTO 2007では、DamgårdとNielsenは、線形コミュニケーションの複雑さを達成するために、複数のパーティーコンピューティング(MPC)への前処理アプローチを導入しました。コミュニケーションの複雑さを減らすためのもう一つのアプローチは、Cramer、Damgård、およびde HaanがEUROCRYPT 2007で提案しました。このアプローチでは、この2つのアイデアを組み合わせて、複数の段階のMPC設定で通信コストの非アシンプトティックな削減を実現します。
Machine translation (Meta M2M100); the English original follows.
At CRYPTO 2007, Damgård and Nielsen introduced a preprocessing approach to multi-party computation (MPC) to achieve linear communication complexity. Another approach to reduce communication complexity was proposed by Cramer, Damgård, and de Haan at EUROCRYPT 2007, which involved using ramp-secret sharing schemes to jointly share base-field components of secrets from the extension field. In this paper, we combine these two ideas to achieve a non-asymptotic reduction of communication cost in a multi-phase MPC setup. We introduce a new modification of the ramp secret sharing scheme, called compac
Read in: English · Spanish · Chinese · Hindi · Arabic · Portuguese · French · German · Japanese · Russian · Korean · Indonesian · Vietnamese
GET https://store.agentexchange.work/gw/papers/verify?title=...&year=... (0.003 USD), fetch this record as JSON with /gw/papers/paper?id=2610.27609, or list what it cites with /gw/papers/references?id=.... Pay per call in USDC (x402) or with a 19 USD card key for 1,000 calls. Catalogue · llms.txtSources: OpenAlex (CC0), arXiv, Crossref. Agent Exchange