Non-interactive anonymous router with quasi-linear router computation

DOI10.1007/978-3-031-48621-0_3MaRDI QIDQ6582211zbMATH OpenFDO

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

Publication date 2 August 2024

Full work available at URL https://doi.org/10.1007/978-3-031-48621-0_3

zbMATH Keywords

anonymous routingnon-interactive protocolspermutation routingprivate-information retrieval

Mathematics Subject Classification ID

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

Recommendations

• Anonymous permutation routing
• Non-interactive anonymous router
• scientific article; zbMATH DE number 7706041
• A Formal Treatment of Onion Routing
• Practical and provably secure onion routing

Cites work

• A Formal Treatment of Onion Routing
• Amplification by shuffling: from local to central differential privacy via anonymity
• Bucket oblivious sort: an extremely simple oblivious sort
• Candidate indistinguishability obfuscation and functional encryption for all circuits
• Candidate obfuscation via oblivious LWE sampling
• Communication Complexity of Byzantine Agreement, Revisited
• Constrained pseudorandom functions and their applications
• Distributed differential privacy via shuffling
• Distributing any elliptic curve based protocol
• Efficient Zero-Knowledge Argument for Correctness of a Shuffle
• Functional signatures and pseudorandom functions
• scientific article; zbMATH DE number 3877077 (Why is no real title available?)
• scientific article; zbMATH DE number 1261806 (Why is no real title available?)
• scientific article; zbMATH DE number 1504554 (Why is no real title available?)
• scientific article; zbMATH DE number 1559545 (Why is no real title available?)
• scientific article; zbMATH DE number 1559546 (Why is no real title available?)
• Incompressible cryptography
• Indistinguishability obfuscation for Turing machines with unbounded memory
• Indistinguishability obfuscation for Turing machines: constant overhead and amortization
• Indistinguishability obfuscation from circular security
• Indistinguishability obfuscation from well-founded assumptions
• Multi-client inner product encryption: function-hiding instantiations without random oracles
• New negative results on differing-inputs obfuscation
• Non-interactive anonymous router
• Non-interactive multiparty computation without correlated randomness
• Obfuscation of probabilistic circuits and applications
• Protecting data privacy in private information retrieval schemes
• Spreading the privacy blanket: differentially oblivious shuffling for differential privacy
• Succinct garbling and indistinguishability obfuscation for RAM programs
• Succinct randomized encodings and their applications
• The dining cryptographers problem: Unconditional sender and recipient untraceability
• The privacy blanket of the shuffle model
• Theory of Cryptography
• Untagging Tor: a formal treatment of onion encryption

Cited in

(2)

• Anonymous permutation routing
• Quasi-linear indistinguishability obfuscation via mathematical proofs of equivalence and applications

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

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