Cryptography from Anonymity

No abstract is available for this paper.

• Publication year

  2006

• Venue

  IEEE Annual Symposium on Foundations of Computer Science

• Publication date

  2006-10-21

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1109/FOCS.2006.25
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Oblivious Polynomial Evaluation

  2006cited by this paper
• Correcting errors beyond the Guruswami-Sudan radius in polynomial time

  2005cited by this paper
• Basing cryptographic protocols on tamper-evident seals

  2005cited by this paper
• Toward Privacy in Public Databases

  2005cited by this paper
• An Oblivious Transfer Protocol with Log-Squared Communication

  2005cited by this paper
• Single-Database Private Information Retrieval with Constant Communication Rate

  2005cited by this paper
• Pseudo-signatures, Broadcast, and Multi-party Computation from Correlated Randomness

  2004cited by this paper
• Provable Unlinkability against Traffic Analysis

  2004cited by this paper
• Batch codes and their applications

  2004cited by this paper
• Information Theory and the Security of Binary Data Perturbation

  2004cited by this paper
• Completeness in Two-Party Secure Computation: A Computational View

  2004cited by this paper
• A Quantitative Approach to Reductions in Secure Computation

  2004cited by this paper
• Reducing the Servers’ Computation in Private Information Retrieval: PIR with Preprocessing

  2004cited by this paper
• Reconstructing curves in three (and higher) dimensional space from noisy data

  2003influential reference
• Revealing information while preserving privacy

  2003cited by this paper
• Decoding of Interleaved Reed Solomon Codes over Noisy Data

  2003cited by this paper
• Perfect Constant-Round Secure Computation via Perfect Randomizing Polynomials

  2002cited by this paper
• Breaking the O(n/sup 1/(2k-1)/) barrier for information-theoretic Private Information Retrieval

  2002cited by this paper
• A Minimal Model for Secure Computation

  2002cited by this paper
• Breaking the Barrier for Information-Theoretic Private Information Retrieval

  2002cited by this paper
• Anonymous Communication and Anonymous Cash

  2002cited by this paper
• Cryptographic Hardness Based on the Decoding of Reed–Solomon Codes

  2002cited by this paper
• Communication preserving protocols for secure function evaluation

  2001cited by this paper
• Secure multiparty computation of approximations

  2001cited by this paper
• Minimal Complete Primitives for Secure Multi-Party Computation

  2001cited by this paper
• Secure Games with Polynomial Expressions

  2001cited by this paper
• Security and Composition of Multiparty Cryptographic Protocols

  2000cited by this paper
• Noisy Polynomial Interpolation and Noisy Chinese Remaindering

  2000cited by this paper
• Reducibility and Completeness in Private Computations

  2000cited by this paper
• Traffic Analysis: Protocols, Attacks, Design Issues, and Open Problems

  2000cited by this paper
• From partial consistency to global broadcast

  2000cited by this paper
• Computationally Private Information Retrieval with Polylogarithmic Communication

  1999cited by this paper
• Oblivious transfer and polynomial evaluation

  1999influential reference
• Efficient Multiparty Computations Secure Against an Adaptive Adversary

  1999cited by this paper
• Improved decoding of Reed-Solomon and algebraic-geometry codes

  1999cited by this paper
• Crowds: anonymity for Web transactions

  1998cited by this paper
• Fair exchange with a semi-trusted third party (extended abstract)

  1997cited by this paper
• Replication is not needed: single database, computationally-private information retrieval

  1997cited by this paper
• Randomness is Linear in Space

  1996cited by this paper
• Anonymous Communication and Anonymous Cash

  1996cited by this paper
• Information-Theoretic Pseudosignatures and Byzantine Agreement for t ≥ n / 3 *

  1996cited by this paper
• Private information retrieval

  1995influential reference
• Secret key agreement by public discussion

  1993cited by this paper
• Secret key agreement by public discussion from common information

  1993cited by this paper
• Multiparty Secret Key Exchange Using a Random Deal of Cards

  1991cited by this paper
• Efficient cryptographic schemes provably as secure as subset sum

  1989cited by this paper
• How to recycle random bits

  1989cited by this paper
• A zero-one law for Boolean privacy

  1989cited by this paper
• Verifiable secret sharing and multiparty protocols with honest majority

  1989cited by this paper
• Privacy Amplification by Public Discussion

  1988cited by this paper
• Founding crytpography on oblivious transfer

  1988cited by this paper
• Elections with Unconditionally-Secret Ballots and Disruption Equivalent to Breaking RSA

  1988cited by this paper
• Networks Without User Observability: Design Options

  1985cited by this paper
• Key Exchange Using 'Keyless Cryptography'

  1983influential reference
• Untraceable electronic mail, return addresses, and digital pseudonyms

  1981cited by this paper

• Bayesian Advantage of Re-Identification Attack in the Shuffle Model

  2025cites this paper
• Toward Personalized Privacy-Preserving Content Caching With Edge Cooperation

  2025cites this paper
• How to Securely Shuffle? A survey about Secure Shufflers for privacy-preserving computations

  2025influential citation
• RM2: Answer Counting Queries Efficiently under Shuffle Differential Privacy

  2025cites this paper
• Dropout-Robust Mechanisms for Differentially Private and Fully Decentralized Mean Estimation

  2025cites this paper
• Encrypted Matrix-Vector Products from Secret Dual Codes

  2025cites this paper
• Efficient Byzantine-Robust Federated Learning Based on the Multimessage Shuffle Protocol for Consumer Internet of Things

  2025cites this paper
• Infinitely Divisible Noise for Differential Privacy: Nearly Optimal Error in the High ϵ Regime

  2025cites this paper
• Lightweight Single-Server PIR with Oλ(n1/3) Communication

  2025cites this paper
• Learning from End User Data with Shuffled Differential Privacy over Kernel Densities

  2025cites this paper
• Mutual Information Bounds in the Shuffle Model

  2025cites this paper
• Robust Additive Randomized Encodings from IO and Pseudo-Non-linear Codes

  2024cites this paper
• FedQV: Leveraging Quadratic Voting in Federated Learning

  2024cites this paper
• A Review on Privacy in DAG-Based DLTs

  2024cites this paper
• Differential Privacy on Trust Graphs

  2024cites this paper
• Single-Server PIR via NTRU-Based FHE: Simpler, Smaller, and Faster

  2024cites this paper
• Beyond Statistical Estimation: Differentially Private Individual Computation via Shuffling

  2024cites this paper
• FedQV: Leveraging Quadratic Voting in Federated Learning

  2024cites this paper
• Beyond Statistical Estimation: Differentially Private Individual Computation in the Shuffle Model

  2024cites this paper
• Piano: Extremely Simple, Single-Server PIR with Sublinear Server Computation

  2024cites this paper
• Unconditional Security Using (Random) Anonymous Bulletin Board

  2024influential citation
• Information-Theoretic Single-Server PIR in the Shuffle Model

  2024cites this paper
• Computationally Secure Aggregation and Private Information Retrieval in the Shuffle Model

  2024cites this paper
• Conan: Distributed Proofs of Compliance for Anonymous Data Collection

  2024influential citation
• Approximate PSI with Near-Linear Communication

  2024cites this paper
• Private Vector Mean Estimation in the Shuffle Model: Optimal Rates Require Many Messages

  2024cites this paper
• Strengthening Privacy in Robust Federated Learning through Secure Aggregation

  2024cites this paper
• A Multi-Shuffler Framework to Establish Mutual Confidence for Secure Federated Learning

  2023cites this paper
• Proof of Compliance for Anonymous, Unlinkable Messages

  2023cites this paper
• Anonymous Federated Learning via Named-Data Networking

  2023cites this paper
• Anonymous federated learning framework in the internet of things

  2023cites this paper
• Privacy-Preserving Large Language Models (PPLLMs)

  2023cites this paper
• Additive Randomized Encodings and Their Applications

  2023influential citation
• Differentially Private Aggregation via Imperfect Shuffling

  2023influential citation
• Analyzing the Shuffle Model Through the Lens of Quantitative Information Flow

  2023cites this paper
• Amplification by Shuffling without Shuffling

  2023influential citation
• Shuffle Differential Private Data Aggregation for Random Population

  2023cites this paper
• Multi-Message Shuffled Privacy in Federated Learning

  2023cites this paper
• SoK: Secure Aggregation Based on Cryptographic Schemes for Federated Learning

  2023cites this paper
• Topology-Hiding Communication from Minimal Assumptions

  2023influential citation
• Efficient transformation capabilities of single database private block retrieval

  2022cites this paper
• Identification, Amplification and Measurement: A bridge to Gaussian Differential Privacy

  2022cites this paper
• Random Forest Algorithm Based on Linear Privacy Budget Allocation

  2022cites this paper
• MPC for Tech Giants (GMPC): Enabling Gulliver and the Lilliputians to Cooperate Amicably

  2022cites this paper
• Optimal Single-Server Private Information Retrieval

  2022cites this paper
• Tight Differential Privacy Guarantees for the Shuffle Model with k-Randomized Response

  2022cites this paper
• Star-specific Key-homomorphic PRFs from Linear Regression and Extremal Set Theory

  2022cites this paper
• Star-Specific Key-Homomorphic PRFs From Learning With Linear Regression

  2022cites this paper
• FedTor: An Anonymous Framework of Federated Learning in Internet of Things

  2022cites this paper
• The Fundamental Price of Secure Aggregation in Differentially Private Federated Learning

  2022cites this paper
• Differential Secrecy for Distributed Data and Applications to Robust Differentially Secure Vector Summation

  2022cites this paper
• Aggregation and Transformation of Vector-Valued Messages in the Shuffle Model of Differential Privacy

  2022cites this paper
• SoK: Privacy-Preserving Computing in the Blockchain Era

  2022cites this paper
• Multiparty Reach and Frequency Histogram: Private, Secure, and Practical

  2021cites this paper
• Differential Privacy in the Shuffle Model: A Survey of Separations

  2021cites this paper
• The Distributed Discrete Gaussian Mechanism for Federated Learning with Secure Aggregation

  2021cites this paper
• Locally Private k-Means in One Round

  2021cites this paper
• Puncturable Pseudorandom Sets and Private Information Retrieval with Near-Optimal Online Bandwidth and Time

  2021cites this paper
• Differentially Private Aggregation in the Shuffle Model: Almost Central Accuracy in Almost a Single Message

  2021influential citation
• The Sample Complexity of Parity Learning in the Robust Shuffle Model

  2021cites this paper
• OnionPIR: Response Efficient Single-Server PIR

  2021cites this paper
• PrivateFetch: Scalable Catalog Delivery in Privacy-Preserving Advertising

  2021cites this paper
• Verifiable Semantic-Aware Ranked Keyword Search in Cloud-Assisted Edge Computing

  2021cites this paper
• Towards Sparse Federated Analytics: Location Heatmaps under Distributed Differential Privacy with Secure Aggregation

  2021cites this paper
• Private Information Retrieval with Preprocessing

  2021cites this paper
• Frequency Estimation in the Shuffle Model with Almost a Single Message

  2021cites this paper
• A General Purpose Data and Query Privacy Preserving Protocol for Wireless Sensor Networks

  2021cites this paper
• Applying the Shuffle Model of Differential Privacy to Vector Aggregation

  2021cites this paper
• Pure Differential Privacy from Secure Intermediaries

  2021cites this paper
• Circuit-Free General-Purpose Multi-Party Computation via Co-Utile Unlinkable Outsourcing

  2021cites this paper
• Private Counting from Anonymous Messages: Near-Optimal Accuracy with Vanishing Communication Overhead

  2020cites this paper
• On the Round Complexity of the Shuffle Model

  2020influential citation
• On Distributed Differential Privacy and Counting Distinct Elements

  2020cites this paper
• Puncturable Pseudorandom Sets and Private Information Retrieval with Polylogarithmic Bandwidth and Sublinear Time

  2020cites this paper
• ZEXE: Enabling Decentralized Private Computation

  2020cites this paper
• Achieving Secure and Efficient Dynamic Searchable Symmetric Encryption over Medical Cloud Data

  2020cites this paper
• Privacy-preserving verifiable delegation of polynomial and matrix functions

  2020influential citation
• Encode, Shuffle, Analyze Privacy Revisited: Formalizations and Empirical Evaluation

  2020cites this paper
• Private Summation in the Multi-Message Shuffle Model

  2020cites this paper
• Pure Differentially Private Summation from Anonymous Messages

  2020cites this paper
• Private Information Retrieval with Sublinear Online Time

  2020cites this paper
• A Novel Category Group Index Mechanism for Efficient Ranked Search of Encrypted Cloud Data

  2020cites this paper
• Connecting Robust Shuffle Privacy and Pan-Privacy

  2020cites this paper
• Batched Differentially Private Information Retrieval

  2020cites this paper
• Fast Privacy-Preserving Keyword Search on Encrypted Outsourced Data

  2019cites this paper
• On the Power of Multiple Anonymous Messages

  2019cites this paper
• The power of synergy in differential privacy: Combining a small curator with local randomizers

  2019cites this paper
• Differentially Private Summation with Multi-Message Shuffling

  2019cites this paper
• Scalable and Differentially Private Distributed Aggregation in the Shuffled Model

  2019cites this paper
• The Privacy Blanket of the Shuffle Model

  2019cites this paper
• Private Aggregation from Fewer Anonymous Messages

  2019cites this paper
• Fast privacy-preserving keyword search on encrypted outsourced data

  2019cites this paper
• Improved Summation from Shuffling

  2019cites this paper
• Certificate-Based Anonymous Device Access Control Scheme for IoT Environment

  2019cites this paper
• A Hybrid Mechanism of Coordinate Matching Based on Multi-Keyword Ranked Search Algorithm Over Encrypted Cloud Data

  2018cites this paper
• A Novel Tamper Evident Single Database Information-Theoretic Private Information Retrieval for User Privacy Applications

  2018cites this paper
• Improving file locality in multi-keyword top-k search based on clustering

  2018cites this paper
• A novel hybrid private information retrieval with non-trivial communication cost

  2018cites this paper
• A Novel Private Information Retrieval Technique for Private DNS Resolution

  2018cites this paper
• A Novel Perfect Privacy Preserving Single Database Private Information Retrieval With Non-trivial Communication

  2017cites this paper