The following pages link to (Q4250776):
Displaying 50 items.
- Selling multiple secrets to a single buyer (Q833739) (← links)
- Dividing secrets to secure data outsourcing (Q903651) (← links)
- Pipelined algorithms to detect cheating in long-term grid computations (Q959812) (← links)
- Private multiparty sampling and approximation of vector combinations (Q1014646) (← links)
- Protecting data privacy in private information retrieval schemes (Q1577014) (← links)
- SQL on structurally-encrypted databases (Q1633448) (← links)
- Tweakable block ciphers secure beyond the birthday bound in the ideal cipher model (Q1633458) (← links)
- Privacy-preserving inverse distance weighted interpolation (Q1639853) (← links)
- The hunting of the SNARK (Q1698394) (← links)
- Simple and efficient two-server ORAM (Q1710667) (← links)
- Homomorphic secret sharing for low degree polynomials (Q1710675) (← links)
- On the tightness of forward-secure signature reductions (Q1715854) (← links)
- Optimal security proofs for full domain hash. Revisited (Q1747667) (← links)
- Oblivious keyword search (Q1827575) (← links)
- More constructions of lossy and correlation-secure trapdoor functions (Q1946593) (← links)
- Verifiable single-server private information retrieval from LWE with binary errors (Q2055570) (← links)
- Private information retrieval with sublinear online time (Q2055601) (← links)
- More efficient digital signatures with tight multi-user security (Q2061945) (← links)
- On the privacy of a code-based single-server computational PIR scheme (Q2120986) (← links)
- Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time (Q2139652) (← links)
- Zero-knowledge proofs for set membership: efficient, succinct, modular (Q2145404) (← links)
- The multi-base discrete logarithm problem: tight reductions and non-rewinding proofs for Schnorr identification and signatures (Q2152049) (← links)
- Single-server private information retrieval with sublinear amortized time (Q2170035) (← links)
- Privacy-enhanced attribute-based private information retrieval (Q2195304) (← links)
- Instantiability of RSA-OAEP under chosen-plaintext attack (Q2408591) (← links)
- General constructions for information-theoretic private information retrieval (Q2485285) (← links)
- Incrementally aggregatable vector commitments and applications to verifiable decentralized storage (Q2692375) (← links)
- On Basing Private Information Retrieval on NP-Hardness (Q2796134) (← links)
- Cryptographic Assumptions: A Position Paper (Q2796139) (← links)
- Practical Techniques Building on Encryption for Protecting and Managing Data in the Cloud (Q2803632) (← links)
- Private Information Retrieval with Preprocessing Based on the Approximate GCD Problem (Q2807210) (← links)
- Spooky Interaction and Its Discontents: Compilers for Succinct Two-Message Argument Systems (Q2829945) (← links)
- From Identification to Signatures, Tightly: A Framework and Generic Transforms (Q2953785) (← links)
- Improved Cryptanalysis of the Multi-Prime φ - Hiding Assumption (Q3011906) (← links)
- Public Key Locally Decodable Codes with Short Keys (Q3088130) (← links)
- General Construction of Chameleon All-But-One Trapdoor Functions (Q3092363) (← links)
- A Storage Efficient Redactable Signature in the Standard Model (Q3399214) (← links)
- Succinct NP Proofs from an Extractability Assumption (Q3507432) (← links)
- On the Validity of the Φ-Hiding Assumption in Cryptographic Protocols (Q3600384) (← links)
- Tighter Reductions for Forward-Secure Signature Schemes (Q4916016) (← links)
- (Q5002790) (← links)
- Homomorphic Encryption (Q5021133) (← links)
- Lossy Identification Schemes from Decisional RSA (Q5135709) (← links)
- Some Open Problems in Information-Theoretic Cryptography (Q5136294) (← links)
- Протокол конфиденциального получения информации (Q5152403) (← links)
- Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments (Q5252662) (← links)
- Fast Private Norm Estimation and Heavy Hitters (Q5445506) (← links)
- A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval (Q5445520) (← links)
- Asymptotically Tight Bounds for Composing ORAM with PIR (Q5738784) (← links)
- A Simpler Rate-Optimal CPIR Protocol (Q5854446) (← links)
