A Permutation Network
From MaRDI portal
Publication:5539432
DOI10.1145/321439.321449zbMath0157.23702OpenAlexW2011849452MaRDI QIDQ5539432
Publication date: 1968
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/321439.321449
Related Items (29)
Methods for message routing in parallel machines ⋮ Secure Multi-party Shuffling ⋮ Perfect shuffling by lazy swaps ⋮ \textsc{EpiGRAM}: practical garbled RAM ⋮ Universality of iterated networks ⋮ Shorter lattice-based zero-knowledge proofs for the correctness of a shuffle ⋮ Time-optimal simulations of networks by universal parallel computers ⋮ PrORAM ⋮ Zero knowledge proofs towards verifiable decentralized AI pipelines ⋮ Efficient and scalable universal circuits ⋮ NanoGRAM: garbled RAM with \(\widetilde{O}(\log N)\) overhead ⋮ Arbitrary-size permutation networks using arbitrary-radix switches ⋮ Unnamed Item ⋮ Manticore: a framework for efficient multiparty computation supporting real number and Boolean arithmetic ⋮ The transposition median problem is NP-complete ⋮ Improved Garbled Circuit: Free XOR Gates and Applications ⋮ Size bounds for superconcentrators ⋮ Shorter arithmetization of nondeterministic computations ⋮ Nonblocking self-routing switching networks ⋮ A theory of decomposition into prime factors of layered interconnection networks ⋮ On the benefit of supporting virtual channels in wormhole routers ⋮ A Practical Universal Circuit Construction and Secure Evaluation of Private Functions ⋮ On rearrangeable and non-blocking switching networks ⋮ Boosting Answer Set Optimization with Weighted Comparator Networks ⋮ Sigma protocols for MQ, PKP and SIS, and fishy signature schemes ⋮ Breaking the circuit size barrier for secure computation under quasi-polynomial LPN ⋮ Private Information Retrieval Using Trusted Hardware ⋮ On permutations of wires and states ⋮ Non-interactive Secure 2PC in the Offline/Online and Batch Settings
This page was built for publication: A Permutation Network
