Theory of Cryptography
From MaRDI portal
Publication:5898359
DOI10.1007/11681878zbMath1112.94027WikidataQ57254512 ScholiaQ57254512MaRDI QIDQ5898359
No author found.
Publication date: 12 February 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11681878
Related Items
On the existence of extractable one-way functions, Black-box non-black-box zero knowledge, Dichotomies in equilibrium computation, and complementary pivot algorithms for a new class of non-separable utility functions, Query complexity of approximate nash equilibria, Constant rank bimatrix games are PPAD-hard, Approximation algorithms for bipartite matching with metric and geometric costs, Distributed approximation algorithms for weighted shortest paths, Parallel algorithms for geometric graph problems, Fourier PCA and robust tensor decomposition, Smoothed analysis of tensor decompositions, Efficient density estimation via piecewise polynomial approximation, Analytical approach to parallel repetition, A characterization of strong approximation resistance, A strongly polynomial algorithm for generalized flow maximization, Approximate distance oracles with constant query time, Faster all-pairs shortest paths via circuit complexity, Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs, Zig-zag sort, Community detection thresholds and the weak Ramanujan property, Distributed computability in Byzantine asynchronous systems, Multiway cut, pairwise realizable distributions, and descending thresholds, Cluster before you hallucinate, Approximation algorithms for regret-bounded vehicle routing and applications to distance-constrained vehicle routing, Improved approximation algorithms for degree-bounded network design problems with node connectivity requirements, Every list-decodable code for high noise has abundant near-optimal rate puncturings, Non-malleable codes from additive combinatorics, Breaking the quadratic barrier for 3-LCC's over the reals, Optimal error rates for interactive coding I, The asymptotic k-SAT threshold, Satisfiability threshold for random regular NAE-SAT, Efficient deterministic approximate counting for low-degree polynomial threshold functions, Communication lower bounds via critical block sensitivity, Computing with a full memory, Hitting sets for multilinear read-once algebraic branching programs, in any order, Generalized Differential Privacy: Regions of Priors That Admit Robust Optimal Mechanisms, Privacy Aware Learning, Formal Verification of Differential Privacy for Interactive Systems (Extended Abstract), Inference using noisy degrees: differentially private \(\beta\)-model and synthetic graphs, Differentially-private learning of low dimensional manifolds, Limitations of Local Filters of Lipschitz and Monotone Functions, New algorithms and lower bounds for circuits with linear threshold gates, Deciding First-Order Properties of Nowhere Dense Graphs, The Matching Polytope has Exponential Extension Complexity, The average sensitivity of an intersection of half spaces, Economic efficiency requires interaction, Fingerprinting codes and the price of approximate differential privacy, Analyze gauss, Private matchings and allocations, Rounding sum-of-squares relaxations, Constant factor approximation for balanced cut in the PIE model, Entropy, optimization and counting, Polynomial bounds for the grid-minor theorem, An excluded half-integral grid theorem for digraphs and the directed disjoint paths problem, Cops, robbers, and threatening skeletons, Pseudorandom generators with optimal seed length for non-boolean poly-size circuits, On derandomizing algorithms that err extremely rarely, Super-polynomial lower bounds for depth-4 homogeneous arithmetic formulas, Lower bounds for depth 4 formulas computing iterated matrix multiplication, The limits of depth reduction for arithmetic formulas, A super-polynomial lower bound for regular arithmetic formulas, A characterization of locally testable affine-invariant properties via decomposition theorems, L p -testing, Turnstile streaming algorithms might as well be linear sketches, Linear time construction of compressed text indices in compact space, Formulas vs. circuits for small distance connectivity, Toward better formula lower bounds, Breaking the minsky-papert barrier for constant-depth circuits, The sample complexity of revenue maximization, Optimal competitive auctions, Homological product codes, A quantum algorithm for computing the unit group of an arbitrary degree number field, Primal beats dual on online packing LPs in the random-order model, Competitive algorithms from competitive equilibria, Minimum bisection is fixed parameter tractable, An efficient parallel solver for SDD linear systems, Solving SDD linear systems in nearly m log 1/2 n time, From hierarchical partitions to hierarchical covers, Shortest paths on polyhedral surfaces and terrains, Embedding and canonizing graphs of bounded genus in logspace, Testing surface area with arbitrary accuracy, Coin flipping of any constant bias implies one-way functions, Infinite randomness expansion with a constant number of devices, From average case complexity to improper learning complexity, Bandits with switching costs, Online local learning via semidefinite programming, How to use indistinguishability obfuscation, How to delegate computations, Circuits resilient to additive attacks with applications to secure computation, Population recovery and partial identification, Lower bounds on the error of query sets under the differentially-private matrix mechanism, Limits on the usefulness of random oracles, Denials leak information: simulatable auditing, Differential privacy based on importance weighting, Simulation extrapolation estimation in parametric models with Laplace measurement error, Optimal data-independent noise for differential privacy, Perturbation of convex risk minimization and its application in differential private learning algorithms, Preserving differential privacy under finite-precision semantics, Data confidentiality: a review of methods for statistical disclosure limitation and methods for assessing privacy, Bounds on the sample complexity for private learning and private data release, Statistical active learning algorithms for noise tolerance and differential privacy, Selling privacy at auction, Efficient algorithms for privately releasing marginals via convex relaxations, Perturbed robust linear estimating equations for confidentiality protection in remote analysis, Differentially private average consensus: obstructions, trade-offs, and optimal algorithm design, A lower bound on the release of differentially private integer partitions, On some connections between statistics and cryptology, Worst- and average-case privacy breaches in randomization mechanisms, Secrecy Without Perfect Randomness: Cryptography with (Bounded) Weak Sources, The Complexity of Computing the Optimal Composition of Differential Privacy, Order-Revealing Encryption and the Hardness of Private Learning, Answering $n^2+o(1)$ Counting Queries with Differential Privacy is Hard, The Geometry of Differential Privacy: The Small Database and Approximate Cases, Towards Privacy-Preserving Data Mining in Online Social Networks: Distance-Grained and Item-Grained Differential Privacy, Practical Fault-Tolerant Data Aggregation, Private Matchings and Allocations, Pufferfish, Authentication in Constrained Settings, Buying Data from Privacy-Aware Individuals: The Effect of Negative Payments, Super-Polylogarithmic Hypergraph Coloring Hardness via Low-Degree Long Codes, An Almost-Optimally Fair Three-Party Coin-Flipping Protocol, Optimal CUR Matrix Decompositions, EXPONENTIAL IMPROVEMENT IN PRECISION FOR SIMULATING SPARSE HAMILTONIANS, Large Margin Multiclass Gaussian Classification with Differential Privacy, Protecting Privacy in Data Release, What Can We Learn Privately?, Inapproximability for Antiferromagnetic Spin Systems in the Tree Nonuniqueness Region, Communication is Bounded by Root of Rank, Are Lock-Free Concurrent Algorithms Practically Wait-Free?, Robust Protocols for Securely Expanding Randomness and Distributing Keys Using Untrusted Quantum Devices, The Power of Localization for Efficiently Learning Linear Separators with Noise, Separating Computational and Statistical Differential Privacy in the Client-Server Model, Concentrated Differential Privacy: Simplifications, Extensions, and Lower Bounds, Strong Hardness of Privacy from Weak Traitor Tracing, Bounds on the Sample Complexity for Private Learning and Private Data Release, An Improved Private Mechanism for Small Databases, Sample Complexity Bounds on Differentially Private Learning via Communication Complexity, Privacy and Truthful Equilibrium Selection for Aggregative Games, Our Data, Ourselves: Privacy Via Distributed Noise Generation, How to deal with malicious users in privacy‐preserving distributed data mining, Distributed Private Data Analysis: Simultaneously Solving How and What
