Towards practical topology-hiding computation

DOI10.1007/978-3-031-22963-3_20MaRDI QIDQ6135413zbMATH OpenOpenAlexFDO

Authors Shuaishuai Li

Publication date 25 August 2023

Published in Advances in Cryptology – ASIACRYPT 2022 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-22963-3_20

zbMATH Keywords

fully-homomorphic encryptionAkavia-Moran protocolGTHC protocol

Mathematics Subject Classification ID

Cryptography (94A60) Distributed systems (68M14)

Recommendations

• Exploring the boundaries of topology-hiding computation
• Is information-theoretic topology-hiding computation possible?
• Topology-hiding computation on all graphs
• Topology-hiding computation on all graphs
• Network-Hiding Communication and Applications to Multi-party Protocols

Cites work

• scientific article; zbMATH DE number 1808209 (Why is no real title available?)
• A public key cryptosystem and a signature scheme based on discrete logarithms
• A simple public-key cryptosystem with a double trapdoor decryption mechanism and its applications
• An Identity Based Encryption Scheme Based on Quadratic Residues
• Better preprocessing for secure multiparty computation
• Communications in unknown networks: preserving the secret of topology
• Exploring the boundaries of topology-hiding computation
• Is information-theoretic topology-hiding computation possible?
• Joint encryption and message-efficient secure computation
• Linearly homomorphic encryption from \(\mathsf {DDH}\)
• Multi-input functional encryption
• Must the communication graph of MPC protocols be an expander?
• Network-Hiding Communication and Applications to Multi-party Protocols
• Non-interactive secure multiparty computation
• On lattices, learning with errors, random linear codes, and cryptography
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Secure computation on the web: computing without simultaneous interaction
• Secure multiparty computation with general interaction patterns
• Topology-hiding communication from minimal assumptions
• Topology-hiding computation
• Topology-hiding computation beyond logarithmic diameter
• Topology-hiding computation beyond semi-honest adversaries
• Topology-hiding computation for networks with unknown delays
• Topology-hiding computation on all graphs
• Topology-hiding computation on all graphs
• Towards practical topology-hiding computation

Cited in

(8)

• Topology-hiding computation on all graphs
• Topology-hiding communication from minimal assumptions
• Towards topology-hiding computation from oblivious transfer
• Exploring the boundaries of topology-hiding computation
• Topology-hiding computation on all graphs
• Is information-theoretic topology-hiding computation possible?
• Correction to: ``Topology-hiding communication from minimal assumptions
• Towards practical topology-hiding computation

This page was built for publication: Towards practical topology-hiding computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6135413)