Asymptotically Ideal Conjunctive Hierarchical Secret Sharing Scheme Based on CRT for Polynomial Ring
Asymptotically Ideal Conjunctive Hierarchical Secret Sharing Scheme Based on CRT for Polynomial Ring explores A theoretical cryptographic scheme for secure secret sharing with improved information rates.. 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 WorkRandomized Distributed Function Computation (RDFC): Ultra-Efficient Semantic Communication Applications to PrivacyViability: 2.0
- Higher ViabilityDDH-based schemes for multi-party Function Secret SharingViability: 4.0
- Higher ViabilitySecret Key Rate Analysis of RIS-Assisted THz MIMO CV-QKD Systems under Localized and Global EavesdroppingViability: 3.0
- Higher ViabilityMaximin Share Guarantees via Limited Cost-Sensitive SharingViability: 3.0
- Higher ViabilityCoding-Enforced Resilient and Secure Aggregation for Hierarchical Federated Learning