Graph coloring applied to secure computation in non-abelian groups
type: Item
instance of: scholarly article
title: Graph coloring applied to secure computation in non-abelian groups
zbMATH Open document ID: 1278.94046
author: Josef Pieprzyk
author: Ron Steinfeld
author: Xiaoming Sun
author: Christophe Tartary
author: Huaxiong Wang
author: Yvo Desmedt
author: Andrew Chi-Chih Yao
published in: Journal of Cryptology
publication date: 2013-01-04T00:00:00Z
full work available at URL: 10.1007/s00145-011-9104-3
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 20F99
Mathematics Subject Classification ID: 68M12
Mathematics Subject Classification ID: 68P25
Mathematics Subject Classification ID: 94A62
zbMATH DE Number: 6121916
zbMATH Keywords: multiparty computation
zbMATH Keywords: graph coloring
zbMATH Keywords: non-abelian group
zbMATH Keywords: black-box operations
zbMATH Keywords: planar graph
zbMATH Keywords: percolation theory
zbMATH Keywords: word problem
Wikidata QID: Q59484974
MaRDI profile type: Publication
OpenAlex ID: W1590063586
cites work: The probabilistic method. With an appendix on the life and work of Paul Erdős.
cites work: Q3778674
cites work: Percolation
cites work: Q4434901
cites work: Scalable and Unconditionally Secure Multiparty Computation
cites work: Theory of Cryptography
cites work: Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
cites work: Algorithms and Computation
cites work: On Secure Multi-party Computation in Black-Box Groups
cites work: Q4507228
cites work: New directions in cryptography
cites work: A public key cryptosystem and a signature scheme based on discrete logarithms
cites work: Q4318723
cites work: Foundations of Cryptography
cites work: Percolation Processes: Lower Bounds for the Critical Probability
cites work: Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract)
cites work: Q3672870
cites work: New approaches to designing public key cryptosystems using one-way functions and trapdoors in finite groups
cites work: Group-based cryptography
cites work: Q4783741
cites work: A method for obtaining digital signatures and public-key cryptosystems
cites work: How to share a secret
cites work: Critical exponents for two-dimensional percolation
cites work: Graph Design for Secure Multiparty Computation over Non-Abelian Groups
DOI: 10.1007/S00145-011-9104-3
description: scientific article; zbMATH DE number 6121916