Non-interactive anonymous router with quasi-linear router computation

DOI10.1007/978-3-031-48621-0_3zbMath1544.9424MaRDI QIDQ6582211

Rex Fernando, Elaine Shi, Nikhil Vanjani, Pratik Soni, Brent Waters

Publication date: 2 August 2024

zbMATH Keywords

permutation routinganonymous routingnon-interactive protocolsprivate-information retrieval

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Internet topics (68M11)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The dining cryptographers problem: Unconditional sender and recipient untraceability
• Protecting data privacy in private information retrieval schemes
• Untagging Tor: a formal treatment of onion encryption
• Indistinguishability obfuscation for Turing machines: constant overhead and amortization
• Non-interactive multiparty computation without correlated randomness
• Candidate obfuscation via oblivious LWE sampling
• Non-interactive anonymous router
• Spreading the privacy blanket: differentially oblivious shuffling for differential privacy
• Incompressible cryptography
• Distributing any elliptic curve based protocol
• Distributed differential privacy via shuffling
• The privacy blanket of the shuffle model
• Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
• Constrained Pseudorandom Functions and Their Applications
• Efficient Zero-Knowledge Argument for Correctness of a Shuffle
• Indistinguishability Obfuscation for Turing Machines with Unbounded Memory
• Succinct Garbling and Indistinguishability Obfuscation for RAM Programs
• Succinct Randomized Encodings and their Applications
• Communication Complexity of Byzantine Agreement, Revisited
• Amplification by Shuffling: From Local to Central Differential Privacy via Anonymity
• Obfuscation of Probabilistic Circuits and Applications
• Functional Signatures and Pseudorandom Functions
• A Formal Treatment of Onion Routing
• New Negative Results on Differing-Inputs Obfuscation
• Theory of Cryptography
• Indistinguishability obfuscation from well-founded assumptions
• Indistinguishability obfuscation from circular security
• Multi-client inner product encryption: function-hiding instantiations without random oracles
• Bucket oblivious sort: an extremely simple oblivious sort

This page was built for publication: Non-interactive anonymous router with quasi-linear router computation