A cryptographic primitive is a fundamental building block of cryptographic systems, such as encryption algorithms or hash functions. These primitives are designed to perform specific security-related tasks and are typically characterized by their mathematical properties and resistance to known attacks. They form the basis for constructing more complex cryptographic protocols and applications.
Context
The ongoing development and analysis of cryptographic primitives are central to maintaining the security of digital assets and blockchain networks. Current discussions often focus on the security guarantees offered by new or existing primitives against advancements in computational power, particularly quantum computing. Future research will likely concentrate on developing post-quantum cryptographic primitives and formal methods for verifying their security properties.
Cryptographers proved a Verifiable Delay Function's fixed sequential time can be bypassed, challenging its use for secure, fair randomness in Proof-of-Stake.
Research demonstrates a scalable distributed randomness beacon by enforcing verifiable inclusion of all entropy contributions using insertion-secure accumulators.
A Distributed Verifiable Random Function, built with threshold cryptography and zk-SNARKs, creates a publicly-verifiable, un-biasable randomness primitive essential for secure leader election and MEV mitigation.
Research introduces ZKPoT consensus, leveraging zk-SNARKs to cryptographically verify machine learning contributions without exposing private training data or model parameters.
This research introduces Proof-of-Transit Timestamping, a novel cryptographic primitive enabling tamper-evident audit trails for Bitcoin across high-latency, intermittently-connected interplanetary links.
zk-SNARKs enable proving computational integrity and data privacy without revealing underlying information, revolutionizing secure and scalable decentralized systems.
This research introduces the first sublinear-space zero-knowledge prover, transforming proof generation into a tree evaluation problem to unlock on-device verifiable computation.
A novel Multi-Client Functional Encryption scheme enables secure, privacy-preserving inner product computations over data from multiple independent sources.
A novel equivalence reframes ZKP generation as tree evaluation, yielding the first sublinear-space prover, unlocking on-device verifiable computation for resource-constrained systems.
This research introduces Proof-of-Transit Timestamping, a cryptographic primitive for verifiable data trails, ensuring Bitcoin's reliability across high-latency space communication.
This research introduces a blockchain architecture leveraging Proof of Quantum Work, rendering mining classically intractable while providing quantum-safe security and reducing environmental impact.
A novel cryptographic primitive, the Verifiable Delay Function, guarantees a predetermined computation time with rapid, public verification, securing decentralized randomness and fair ordering.
A novel framework enables third-party computation and efficient set updates for private set intersection, expanding its utility in dynamic, privacy-preserving distributed systems.
vetKD enables dapps to securely derive and transport private cryptographic keys on public blockchains, ensuring data confidentiality without centralized trust.
This work introduces publicly verifiable private information retrieval, allowing any party to confirm data integrity without compromising query privacy, crucial for transparent decentralized systems.
This research introduces Batched Identity-Based Encryption, a novel primitive enabling selective transaction decryption to advance blockchain mempool privacy and efficiency.
This research introduces oblivious accumulators, a novel cryptographic primitive that conceals set elements and size, enabling private and stateless blockchain architectures.
This research fundamentally proves Verifiable Delay Functions cannot exist in the Random Oracle Model, challenging foundational assumptions for secure randomness in decentralized systems.
A new cryptographic primitive, permutable pseudorandom permutations, enables the first standard-model one-shot signatures, securing single-use digital transactions.
A novel cryptographic primitive, Group Verifiable Random Functions, enables scalable, user-generated anonymous tokens, fundamentally transforming privacy-preserving access control and authentication.
A new post-quantum cryptographic primitive, Affine One-Wayness (AOW), enables verifiable temporal ordering in distributed systems without trusted authorities, crucial for future blockchain security.
This research introduces a novel cryptographic primitive enabling private set intersection where one party learns the common elements succinctly, without revealing their own set.
We use cookies to personalize content and marketing, and to analyze our traffic. This helps us maintain the quality of our free resources. manage your preferences below.
Detailed Cookie Preferences
This helps support our free resources through personalized marketing efforts and promotions.
Analytics cookies help us understand how visitors interact with our website, improving user experience and website performance.
Personalization cookies enable us to customize the content and features of our site based on your interactions, offering a more tailored experience.
