scientific article; zbMATH DE number 1304086
From MaRDI portal
Publication:4250776
zbMATH Open0932.68042MaRDI QIDQ4250776FDOQ4250776
Authors: Christian Cachin, Silvio Micali, Markus A. Stadler 
Publication date: 17 June 1999
Title of this publication is not available (Why is that?)
Recommendations
Cited In (69)
- Lower bounds for (batch) PIR with private preprocessing
- Optimal single-server private information retrieval
- Sublinear secure computation from new assumptions
- \textsf{TreePIR}: sublinear-time and polylog-bandwidth private information retrieval from DDH
- Improved and formal proposal for device-independent quantum private query *
- Efficient pre-processing PIR without public-key cryptography
- Lower-bounds on public-key operations in PIR
- Inner product functional commitments with constant-size public parameters and openings
- Fully malicious authenticated PIR
- Hintless single-server private information retrieval
- PIR with client-side preprocessing: information-theoretic constructions and lower bounds
- Secure computation of the median (and other elements of specified ranks)
- Pipelined algorithms to detect cheating in long-term grid computations
- Asymptotically Tight Bounds for Composing ORAM with PIR
- Privacy-Preserving Queries on Encrypted Data
- Locally verifiable signature and key aggregation
- Homomorphic Encryption
- Optimal security proofs for full domain hash. Revisited
- General Construction of Chameleon All-But-One Trapdoor Functions
- A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval
- On the privacy of a code-based single-server computational PIR scheme
- Minicrypt primitives with algebraic structure and applications
- Lossy Identification Schemes from Decisional RSA
- Fast Private Norm Estimation and Heavy Hitters
- From Identification to Signatures, Tightly: A Framework and Generic Transforms
- Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments
- Zero-knowledge proofs for set membership: efficient, succinct, modular
- The multi-base discrete logarithm problem: tight reductions and non-rewinding proofs for Schnorr identification and signatures
- SQL on structurally-encrypted databases
- Tweakable block ciphers secure beyond the birthday bound in the ideal cipher model
- Simple and efficient two-server ORAM
- Title not available (Why is that?)
- Privacy-preserving inverse distance weighted interpolation
- Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time
- Протокол конфиденциального получения информации
- Public Key Locally Decodable Codes with Short Keys
- A Storage Efficient Redactable Signature in the Standard Model
- Private multiparty sampling and approximation of vector combinations
- More constructions of lossy and correlation-secure trapdoor functions
- More efficient digital signatures with tight multi-user security
- Some Open Problems in Information-Theoretic Cryptography
- Anonymous (hierarchical) identity-based encryption from broader assumptions
- Cryptographic Assumptions: A Position Paper
- On Basing Private Information Retrieval on NP-Hardness
- Instantiability of RSA-OAEP under chosen-plaintext attack
- Tighter Reductions for Forward-Secure Signature Schemes
- Single-server private information retrieval with sublinear amortized time
- On the Validity of the Φ-Hiding Assumption in Cryptographic Protocols
- Incrementally aggregatable vector commitments and applications to verifiable decentralized storage
- Private information retrieval with sublinear online time
- Verifiable single-server private information retrieval from LWE with binary errors
- Succinct NP Proofs from an Extractability Assumption
- Improved cryptanalysis of the multi-prime \(\varphi\)-hiding assumption
- Spooky Interaction and Its Discontents: Compilers for Succinct Two-Message Argument Systems
- Privacy-enhanced attribute-based private information retrieval
- Private Information Retrieval with Preprocessing Based on the Approximate GCD Problem
- The hunting of the SNARK
- General constructions for information-theoretic private information retrieval
- Protecting data privacy in private information retrieval schemes
- Practical Techniques Building on Encryption for Protecting and Managing Data in the Cloud
- A proposal for device independent probabilistic quantum oblivious transfer
- Oblivious keyword search
- A Simpler Rate-Optimal CPIR Protocol
- Homomorphic secret sharing for low degree polynomials
- Selling multiple secrets to a single buyer
- Multi-query Computationally-Private Information Retrieval with Constant Communication Rate
- Zero-knowledge proofs for set membership: efficient, succinct, modular
- Dividing secrets to secure data outsourcing
- On the tightness of forward-secure signature reductions
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4250776)
