# Efficient Information-Theoretic Secure Multiparty Computation over $$\mathbb {Z}/p^k\mathbb {Z}$$ via Galois Rings

**Type:** Papers  
**Canonical URL:** https://scholariq.org/papers/efficient-information-theoretic-secure-multiparty-computation-over-mathbb-z-p-k/

## Facts

| Field | Value |
| --- | --- |
| Author Names | Mark Abspoel,Ronald Cramer,Ivan Damgård,Daniel Escudero,Chen Yuan |
| Citations | 41 |
| DOI | 10.1007/978-3-030-36030-6_19 |
| Fields | Computer Science |
| Open Access | true |
| OA Status | green |
| OA URL | https://ir.cwi.nl/pub/29216 |
| OpenAlex ID | https://openalex.org/W2991155000 |
| Type | conference-paper |
| Year | 2019 |

## Paper authors

- [Chen Yuan](https://scholariq.org/researchers/chen-yuan/)

## Paper journal

- [Lecture notes in computer science](https://scholariq.org/journals/lecture-notes-in-computer-science/)

## Paper primary topic

- [Cryptography and Data Security](https://scholariq.org/topics/cryptography-and-data-security/)

## Paper topics

- [Cryptography and Data Security](https://scholariq.org/topics/cryptography-and-data-security/)
- [Complexity and Algorithms in Graphs](https://scholariq.org/topics/complexity-and-algorithms-in-graphs/)

---
Source: ScholarIQ — public research metadata, principally OpenAlex. See https://scholariq.org/sources/ for provenance and https://scholariq.org/methodology/ for what these figures mean.