Anonymous permutation routing

DOI10.1007/978-3-031-48621-0_2MaRDI QIDQ6582210zbMATH OpenFDO

Authors Paul Bunn, Eyal Kushilevitz, Rafail Ostrovsky

Publication date 2 August 2024

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

zbMATH Keywords

anonymous routingnon-interactive protocolspermutation routingprivate-information retrieval

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

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

Cites work

• A Survey of Single-Database Private Information Retrieval: Techniques and Applications
• Amortizing rate-1 OT and applications to PIR and PSI
• Batch codes and their applications
• Efficient range-trapdoor functions and applications: rate-1 OT and more
• Evaluating Branching Programs on Encrypted Data
• scientific article; zbMATH DE number 1261806 (Why is no real title available?)
• Non-interactive anonymous router
• Private anonymous data access
• Public-Key Encryption with Efficient Amortized Updates
• Sorting in \(c \log n\) parallel steps
• Trapdoor hash functions and their applications

Cited in

(1)

• Non-interactive anonymous router with quasi-linear router computation

This page was built for publication: Anonymous permutation routing

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