Wilton Kim, Van Long Phuoc Pham, Stanislav Kruglik, Han Mao Kiah · 2026 · arXiv
DOI: 10.48550/arXiv.2610.27609 · open-access PDF
Bei CRYPTO 2007 führten Damgård und Nielsen einen Vorverarbeitungsansatz für Multi-Party-Computing (MPC) ein, um lineare Kommunikationskomplexität zu erreichen. Ein anderer Ansatz zur Verringerung der Kommunikationskomplexität wurde von Cramer, Damgård und de Haan bei EUROCRYPT 2007 vorgeschlagen, der die Verwendung von Ramp-Secret-Sharing-Schemata beinhaltete, um Basisfeldkomponenten von Geheimnissen aus dem Erweiterungsfeld gemeinsam zu teilen.
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