A Permutation Network - MaRDI portal

Cited in

(32)

Efficient and scalable universal circuits
A theory of decomposition into prime factors of layered interconnection networks
Arbitrary-size permutation networks using arbitrary-radix switches
Boosting Answer Set Optimization with Weighted Comparator Networks
NanoGRAM: garbled RAM with \(\widetilde{O}(\log N)\) overhead
Time-optimal simulations of networks by universal parallel computers
PFE: linear active security, double-shuffle proofs, and low-complexity communication
Secure Multi-party Shuffling
Private information retrieval using trusted hardware
Constant-round multiparty private function evaluation with (quasi-)linear complexities
Sigma protocols for MQ, PKP and SIS, and fishy signature schemes
On rearrangeable and non-blocking switching networks
PrORAM
Zero knowledge proofs towards verifiable decentralized AI pipelines
Universality of iterated networks
Non-interactive secure 2PC in the offline/online and batch settings
Short reachability networks
Size bounds for superconcentrators
Perfect shuffling by lazy swaps
The transposition median problem is NP-complete
\textsc{EpiGRAM}: practical garbled RAM
Shorter lattice-based zero-knowledge proofs for the correctness of a shuffle
Breaking the circuit size barrier for secure computation under quasi-polynomial LPN
Methods for message routing in parallel machines
Shorter arithmetization of nondeterministic computations
A Practical Universal Circuit Construction and Secure Evaluation of Private Functions
Nonblocking self-routing switching networks
On the benefit of supporting virtual channels in wormhole routers
On permutations of wires and states
Improved Garbled Circuit: Free XOR Gates and Applications
Manticore: a framework for efficient multiparty computation supporting real number and Boolean arithmetic
CacheShuffle: a family of oblivious shuffles

This page was built for publication: A Permutation Network

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