Non-interactive anonymous router (Q2056804)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Non-interactive anonymous router	scientific article

Statements

scholarly article

0 references

Non-interactive anonymous router (English)

0 references

0 references

0 references

publication date

8 December 2021

0 references

zbMATH Keywords

anonymous routing

0 references

threshold model

0 references

untrusted router

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-030-77883-5_17

0 references

From single-input to multi-client inner-product functional encryption

0 references

Simple Functional Encryption Schemes for Inner Products

0 references

Multi-input functional encryption for inner products: function-hiding realizations and constructions without pairings

0 references

Multi-input Inner-Product Functional Encryption from Pairings

0 references

Functional encryption for attribute-weighted sums from \(k\)-Lin

0 references

0 references

How to Shuffle in Public

0 references

Fully Secure Functional Encryption for Inner Products, from Standard Assumptions

0 references

The privacy blanket of the shuffle model

0 references

0 references

Efficient Zero-Knowledge Argument for Correctness of a Shuffle

0 references

Distributed Private Data Analysis: Simultaneously Solving How and What

0 references

P-signatures and Noninteractive Anonymous Credentials

0 references

Function-Hiding Inner Product Encryption

0 references

Functional Encryption: Definitions and Challenges

0 references

Conjunctive, Subset, and Range Queries on Encrypted Data

0 references

Multi-input functional encryption in the private-key setting: stronger security from weaker assumptions

0 references

A Formal Treatment of Onion Routing

0 references

Obfuscation of Probabilistic Circuits and Applications

0 references

Optimal Lower Bound for Differentially Private Multi-party Aggregation

0 references

0 references

The dining cryptographers problem: Unconditional sender and recipient untraceability

0 references

Distributed differential privacy via shuffling

0 references

Decentralized multi-client functional encryption for inner product

0 references

Untagging Tor: a formal treatment of onion encryption

0 references

Theory of Cryptography

0 references

Amplification by Shuffling: From Local to Central Differential Privacy via Anonymity

0 references

Protecting data privacy in private information retrieval schemes

0 references

Multi-input Functional Encryption

0 references

Predicate Encryption for Circuits from LWE

0 references

Multi-client functional encryption for linear functions in the standard model from LWE

0 references

Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs

0 references

0 references

Fuzzy Identity-Based Encryption

0 references

0 references

Predicate Privacy in Encryption Systems

0 references

Distributed Private Data Analysis

0 references

Non-interactive anonymous router

0 references

Candidate obfuscation via oblivious LWE sampling

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-030-77883-5_17

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2056804

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2056804&oldid=36746957"