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