Computational bounds on hierarchical data processing with applications to information security
From MaRDI portal
Recommendations
- Performing computations on hierarchically shared secrets
- Upper bound computation of information leakages for unbounded recursion
- Concurrent secure computation with optimal query complexity
- Parallel reducibility for information-theoretically secure computation
- Secure Computation of Constant-Depth Circuits with Applications to Database Search Problems
- The complexity of synchronous notions of information flow security
- The complexity of synchronous notions of information flow security
- Limits of practical sublinear secure computation
- Secure information hiding based on computationally intractable problems
- On the communication complexity of secure computation
Cited in
(7)- Authenticated hash tables based on cryptographic accumulators
- Integrity and consistency for untrusted services (extended abstract)
- Cost of multicast logical key tree based on hierarchical data processing
- Analysis of Multivariate Hash Functions
- Super-Efficient Verification of Dynamic Outsourced Databases
- Efficient authenticated data structures for graph connectivity and geometric search problems
- Secure key-updating for lazy revocation
This page was built for publication: Computational bounds on hierarchical data processing with applications to information security
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5716770)