Private simultaneous messages based on quadratic residues

DOI10.1007/s10623-023-01279-5zbMath1527.94068arXiv2209.01859OpenAlexW4385874110MaRDI QIDQ6070349

Shohei Satake, Reo Eriguchi, Kazumasa Shinagawa, Koji Nuida

Publication date: 20 November 2023

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2209.01859

zbMATH Keywords

symmetric functionsPaley graphsquadratic residuessecure multiparty computationprivate simultaneous messages

Mathematics Subject Classification ID

Applications of graph theory (05C90) Symmetric functions and generalizations (05E05) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graphs which contain all small graphs
• The complexity of multiparty PSM protocols and related models
• On explicit random-like tournaments
• Topics in multiplicative number theory
• Multi-party PSM, revisited: improved communication and unbalanced communication
• The Difference Between Consecutive Primes, II
• A minimal model for secure computation (extended abstract)
• Non-Interactive Secure Multiparty Computation
• Paley graphs satisfy all first-order adjacency axioms
• On the Distribution of Quadratic Residues and Nonresidues Modulo a Prime Number
• Some Open Problems in Information-Theoretic Cryptography
• On the adjacency properties of paley graphs
• A Constructive Solution to a Tournament Problem
• The random graph
• On the Cryptographic Complexity of the Worst Functions
• The communication complexity of private simultaneous messages, revisited

This page was built for publication: Private simultaneous messages based on quadratic residues