The following pages link to A Permutation Network (Q5539432):
Displaying 28 items.
- Shorter arithmetization of nondeterministic computations (Q496013) (← links)
- A theory of decomposition into prime factors of layered interconnection networks (Q531607) (← links)
- The transposition median problem is NP-complete (Q631772) (← links)
- On permutations of wires and states (Q1064313) (← links)
- Size bounds for superconcentrators (Q1170885) (← links)
- Nonblocking self-routing switching networks (Q1199436) (← links)
- On rearrangeable and non-blocking switching networks (Q1250088) (← links)
- Methods for message routing in parallel machines (Q1330418) (← links)
- Perfect shuffling by lazy swaps (Q1663759) (← links)
- Sigma protocols for MQ, PKP and SIS, and fishy signature schemes (Q2055652) (← links)
- Breaking the circuit size barrier for secure computation under quasi-polynomial LPN (Q2056771) (← links)
- \textsc{EpiGRAM}: practical garbled RAM (Q2169989) (← links)
- Efficient and scalable universal circuits (Q2188968) (← links)
- Shorter lattice-based zero-knowledge proofs for the correctness of a shuffle (Q2670855) (← links)
- Secure Multi-party Shuffling (Q3460735) (← links)
- Improved Garbled Circuit: Free XOR Gates and Applications (Q3519525) (← links)
- A Practical Universal Circuit Construction and Secure Evaluation of Private Functions (Q3603006) (← links)
- Universality of iterated networks (Q4311638) (← links)
- Boosting Answer Set Optimization with Weighted Comparator Networks (Q4957202) (← links)
- (Q5002851) (← links)
- Time-optimal simulations of networks by universal parallel computers (Q5096148) (← links)
- Non-interactive Secure 2PC in the Offline/Online and Batch Settings (Q5270370) (← links)
- Private Information Retrieval Using Trusted Hardware (Q5862520) (← links)
- On the benefit of supporting virtual channels in wormhole routers (Q5943124) (← links)
- Arbitrary-size permutation networks using arbitrary-radix switches (Q6159027) (← links)
- Manticore: a framework for efficient multiparty computation supporting real number and Boolean arithmetic (Q6176271) (← links)
- Constant-round multiparty private function evaluation with (quasi-)linear complexities (Q6535112) (← links)
- PFE: linear active security, double-shuffle proofs, and low-complexity communication (Q6573663) (← links)
