Towards practical topology-hiding computation
From MaRDI portal
Publication:6135413
DOI10.1007/978-3-031-22963-3_20zbMATH Open1519.94160OpenAlexW4317928281MaRDI QIDQ6135413FDOQ6135413
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
Recommendations
Cites Work
- An Identity Based Encryption Scheme Based on Quadratic Residues
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- On lattices, learning with errors, random linear codes, and cryptography
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Title not available (Why is that?)
- A simple public-key cryptosystem with a double trapdoor decryption mechanism and its applications
- Multi-input functional encryption
- Must the communication graph of MPC protocols be an expander?
- Non-interactive secure multiparty computation
- Joint encryption and message-efficient secure computation
- Secure multiparty computation with general interaction patterns
- Topology-hiding computation beyond semi-honest adversaries
- Exploring the boundaries of topology-hiding computation
- Communications in unknown networks: preserving the secret of topology
- Network-Hiding Communication and Applications to Multi-party Protocols
- Secure computation on the web: computing without simultaneous interaction
- Topology-hiding computation
- Topology-hiding computation beyond logarithmic diameter
- Topology-hiding computation on all graphs
- Linearly homomorphic encryption from \(\mathsf {DDH}\)
- Better preprocessing for secure multiparty computation
- Topology-hiding computation for networks with unknown delays
- Topology-hiding communication from minimal assumptions
- Towards practical topology-hiding computation
- Is information-theoretic topology-hiding computation possible?
- Topology-hiding computation on all graphs
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)
