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
The average sensitivity of an intersection of half spaces, 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, 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, Unnamed Item, Unnamed Item, Unnamed Item, 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, Outsourcing Medical Dataset Analysis: A Possible Solution, Topics and Techniques in Distribution Testing: A Biased but Representative Sample, Balancing Inferential Integrity and Disclosure Risk Via Model Targeted Masking and Multiple Imputation, Asymmetric Distances for Approximate Differential Privacy, Average Sensitivity of Graph Algorithms, Privacy-preserving federated learning on lattice quantization, The complexity of secure RAMs, Phase transitions for support recovery under local differential privacy, Regression with Set-Valued Categorical Predictors, Private disclosure with multiple agents, Distributed online bandit linear regressions with differential privacy, Distribution-invariant differential privacy, A Simple Algorithm for Estimating Distribution Parameters from $$n$$ n -Dimensional Randomized Binary Responses, Distributed encryption fusion estimation against full eavesdropping, Private join and compute from PIR with default, Comparing approximate and probabilistic differential privacy parameters, (k, l)-Clustering for Transactional Data Streams Anonymization, Data curation from privacy-aware agents, Gradient-tracking based differentially private distributed optimization with enhanced optimization accuracy, One-time programs from commodity hardware, Encrypted quantum state tomography with phase estimation for quantum Internet, Interactive versus noninteractive locally differentially private estimation: two elbows for the quadratic functional, Canonical noise distributions and private hypothesis tests, On robustness and local differential privacy, Unnamed Item, Fingerprinting Codes and the Price of Approximate Differential Privacy, Rejoinder, Comment, Comment, Statistical Query Algorithms for Mean Vector Estimation and Stochastic Convex Optimization, TIGHTER BOUNDS FOR THE DISCREPANCY OF BOXES AND POLYTOPES, A Generalized Approach for Social Network Integration and Analysis with Privacy Preservation, 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, Minimax Optimal Procedures for Locally Private Estimation, On the Power of Learning from k-Wise Queries, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Test Data Reuse for the Evaluation of Continuously Evolving Classification Algorithms Using the Area under the Receiver Operating Characteristic Curve, Algorithmic Stability for Adaptive Data Analysis, Structure and Sensitivity in Differential Privacy: Comparing K-Norm Mechanisms, Privacy-Preserving Parametric Inference: A Case for Robust Statistics, Unnamed Item, Unnamed Item, Unnamed Item, The Complexity of Differential Privacy, A Novel Adaptive Differential Privacy Algorithm for Empirical Risk Minimization, Private Sequential Learning, Directed Networks with a Differentially Private Bi-degree Sequence, On the measurement complexity of differentially private query answering, Unnamed Item, Unnamed Item, Unnamed Item, Asymptotics in theβ-model for networks with a differentially private degree sequence, Finite Sample Differentially Private Confidence Intervals, Weighted directed networks with a differentially private bi-degree sequence, Asymptotic in undirected random graph models with a noisy degree sequence, Model averaging with privacy-preserving, Differentially Private Learning of Geometric Concepts, Tighter Bounds on MultiParty Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling, Private Sampling: A Noiseless Approach for Generating Differentially Private Synthetic Data, HDDA: DataSifter: statistical obfuscation of electronic health records and other sensitive datasets, Econometrics with Privacy Preservation, Collusion Resistant Traitor Tracing from Learning with Errors, Differential Privacy on Finite Computers, A Differential Privacy Mechanism that Accounts for Network Effects for Crowdsourcing Systems, Economic efficiency requires interaction, Segmentation, Incentives, and Privacy, On Privacy and Accuracy in Data Releases (Invited Paper), Scalable and Jointly Differentially Private Packing, 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, 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, Smart Contract-Driven Mechanism Design to Mitigate Information Diffusion in Social Networks, Perturbation Paradigms of Maintaining Privacy-Preserving Monotonicity for Differential Privacy, Differentially Private Distributed Learning, Differentially Private Significance Tests for Regression Coefficients, 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, Bloom Filters in Adversarial Environments, 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, 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, A firm foundation for statistical disclosure control, Some basics on privacy techniques, anonymization and their big data challenges, Confidentiality and differential privacy in the dissemination of frequency tables, Preserving differential privacy in convolutional deep belief networks, Differentially private nearest neighbor classification, Approximate relational Hoare logic for continuous random samplings, Data confidentiality: a review of methods for statistical disclosure limitation and methods for assessing privacy, Generalized bucketization scheme for flexible privacy settings, New collaborative filtering algorithms based on SVD++ and differential privacy, On density estimation at a fixed point under local differential privacy, Strongly universally consistent nonparametric regression and classification with privatised data, The cost of privacy: optimal rates of convergence for parameter estimation with differential privacy, An optimal \((\epsilon, \delta )\)-differentially private learning of distributed deep fuzzy models, On the power of multiple anonymous messages: frequency estimation and selection in the shuffle model of differential privacy, Non-interactive anonymous router, Differentially private data release via statistical election to partition sequentially, Minimax optimal goodness-of-fit testing for densities and multinomials under a local differential privacy constraint, Spreading the privacy blanket: differentially oblivious shuffling for differential privacy, Machine unlearning: linear filtration for logit-based classifiers, A differentially private hybrid approach to traffic monitoring, Formalizing data deletion in the context of the right to be forgotten, Affiliation weighted networks with a differentially private degree sequence, Differentially private data publishing for arbitrarily partitioned data, Correlated tuple data release via differential privacy, Distributionally-robust machine learning using locally differentially-private data, Federated personalized random forest for human activity recognition, Obtaining minimax lower bounds: a review, Efficient noise generation to achieve differential privacy with applications to secure multiparty computation, Locality sensitive hashing with extended differential privacy, Asymptotic in the ordered networks with a noisy degree sequence, Efficient and secure outsourcing of differentially private data publication, Channels of small log-ratio leakage and characterization of two-party differentially private computation, Stronger lower bounds for online ORAM, Preserving differential privacy in deep neural networks with relevance-based adaptive noise imposition, Oblivious sampling with applications to two-party \(k\)-means clustering, Jo-DPMF: differentially private matrix factorization learning through joint optimization, An information theoretic approach to post randomization methods under differential privacy, PCPs and the hardness of generating synthetic data, Geometrizing rates of convergence under local differential privacy constraints, Comparative study of differentially private data synthesis methods, Learning privately with labeled and unlabeled examples, The optimal upper bound of the number of queries for Laplace mechanism under differential privacy, A smart privacy-preserving learning method by fake gradients to protect users items in recommender systems, Coupled relational symbolic execution for differential privacy, Differential privacy of hierarchical Census data: an optimization approach, Bounds on the sample complexity for private learning and private data release, Resilient consensus for multi-agent systems subject to differential privacy requirements, Achieving differential privacy of trajectory data publishing in participatory sensing, A differential privacy framework for collaborative filtering, Bounded privacy-utility monotonicity indicating bounded tradeoff of differential privacy mechanisms, Tight lower bound of sparse covariance matrix estimation in the local differential privacy model, Optimal locally private estimation under \(\ell_p\) loss for \(1\le p\le 2\), Exact MCMC with differentially private moves. Exact MCMC with differentially private moves, revisiting the penalty algorithm in a data privacy framework, 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, Inferring ground truth from crowdsourced data under local attribute differential privacy, Differentially private high dimensional sparse covariance matrix estimation, Differentially private precision matrix estimation, Modular control under privacy protection: fundamental trade-offs, Privacy protection with heavy-tailed noise for linear dynamical systems, Differentially private distributed optimization for multi-agent systems via the augmented Lagrangian algorithm, Differentially private SGD with non-smooth losses, A survey of privacy-preserving mechanisms for heterogeneous data types, Computing payoff allocations in the approximate core of linear programming games in a privacy-preserving manner, Model checking differentially private properties, Differential initial-value privacy and observability of linear dynamical systems, Privacy-preserving dual stochastic push-sum algorithm for distributed constrained optimization, Concurrent composition of differential privacy, 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
