Cryptanalysis of a PIR Scheme based on Linear Codes over Rings
Cryptanalysis of a PIR Scheme based on Linear Codes over Rings explores This paper presents a theoretical attack on a private information retrieval scheme based on linear codes over rings, demonstrating a vulnerability in the server's ability to retrieve file indices.. Commercial viability score: 2/10 in Cryptography.
BUILDER'S SANDBOX
Build This Paper
Use an AI coding agent to implement this research.
OpenAI CodexAI Agent
Lightweight coding agent in your terminal.
Claude CodeAI Agent
Agentic coding tool for terminal workflows.
AntiGravity IDEScaffolding
AI agent mindset installer and workflow scaffolder.
CursorIDE
AI-first code editor built on VS Code.
VS CodeIDE
Free, open-source editor by Microsoft.
Recommended Stack
Startup Essentials
Estimated $9K - $13K over 6-10 weeks.
See exactly what it costs to build this -- with 3 comparable funded startups.
7-day free trial. Cancel anytime.
Discover the researchers behind this paper and find similar experts.
7-day free trial. Cancel anytime.
Related Papers
- Prior WorkEfficient DPF-based Error-Detecting Information-Theoretic Private Information Retrieval Over RingsViability: 2.0
- Prior WorkRandomized Distributed Function Computation (RDFC): Ultra-Efficient Semantic Communication Applications to PrivacyViability: 2.0
- Higher ViabilityZipPIR: High-throughput Single-server PIR without Client-side StorageViability: 7.0
- Higher ViabilityCapturing P: On the Expressive Power and Efficient Evaluation of Boolean RetrievalViability: 3.0
- Higher Viability$p^2$RAG: Privacy-Preserving RAG Service Supporting Arbitrary Top-$k$ Retrieval