Non-interactive anonymous router
From MaRDI portal
Publication:2056804
DOI10.1007/978-3-030-77883-5_17zbMath1479.94254OpenAlexW3157405212MaRDI QIDQ2056804
Publication date: 8 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-77883-5_17
Network design and communication in computer systems (68M10) Cryptography (94A60) Data encryption (aspects in computer science) (68P25)
Related Items (4)
A theory of composition for differential obliviousness ⋮ Multi-client inner product encryption: function-hiding instantiations without random oracles ⋮ Anonymous random allocation and its applications ⋮ Non-interactive anonymous router
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
- Multi-input functional encryption for inner products: function-hiding realizations and constructions without pairings
- Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs
- Decentralized multi-client functional encryption for inner product
- Multi-input functional encryption in the private-key setting: stronger security from weaker assumptions
- Candidate obfuscation via oblivious LWE sampling
- Non-interactive anonymous router
- Functional encryption for attribute-weighted sums from \(k\)-Lin
- Multi-client functional encryption for linear functions in the standard model from LWE
- From single-input to multi-client inner-product functional encryption
- Distributed differential privacy via shuffling
- The privacy blanket of the shuffle model
- Function-Hiding Inner Product Encryption
- Fully Secure Functional Encryption for Inner Products, from Standard Assumptions
- Efficient Zero-Knowledge Argument for Correctness of a Shuffle
- Optimal Lower Bound for Differentially Private Multi-party Aggregation
- Simple Functional Encryption Schemes for Inner Products
- Functional Encryption: Definitions and Challenges
- Predicate Encryption for Circuits from LWE
- How to Shuffle in Public
- Conjunctive, Subset, and Range Queries on Encrypted Data
- Distributed Private Data Analysis: Simultaneously Solving How and What
- Predicate Privacy in Encryption Systems
- Distributed Private Data Analysis
- Amplification by Shuffling: From Local to Central Differential Privacy via Anonymity
- Obfuscation of Probabilistic Circuits and Applications
- Fuzzy Identity-Based Encryption
- Multi-input Functional Encryption
- P-signatures and Noninteractive Anonymous Credentials
- A Formal Treatment of Onion Routing
- Multi-input Inner-Product Functional Encryption from Pairings
- Theory of Cryptography
This page was built for publication: Non-interactive anonymous router
