Privacy Through Simplicity; Zero-Knowledge Age Verification has arrived.
A trained professional verifies your eligibility on-site at any trusted establishment—bars, retailers, or licensed venues—using visual confirmation only. Your device generates a cryptographic proof of eligibility and receives a unique instance ID. No scanning. No photography. No data collection.
When first accessing age-restricted content, authenticate once with your biometrics or password. This starts a verification session that remains active across all sites—no repeated authentication. Your proving key never leaves your device and is bound exclusively to your authentication method.
During an active session, every verification is instant. Your device sends only your instance ID to our servers—no proof generation required. We confirm your verified status and respond to the requesting site. No personal data. No authentication prompts. Just seamless access.
Lockette implements Zero-Knowledge cryptography1—a class of cryptographic protocols that enable us to mathematically prove verification without learning anything about you. This isn't a policy choice—it's architectural. Our servers are designed to be incapable of storing your personal information.
Even if our servers were compromised, attackers would find nothing valuable—we simply don't have your data to steal.
One-Time Setup: A professional verifies your age in person. Your device generates a cryptographic credential that proves eligibility without revealing identity.
Every Visit After: Authenticate with biometrics or password on your device. Websites receive a simple yes/no—nothing more.
Session-based architecture means you authenticate once and access everything seamlessly. Your credentials are hardware-bound to your device and cannot be transferred, cloned, or shared.
Our approach is grounded in peer-reviewed cryptographic research from leading institutions, including foundational work on Zero-Knowledge proofs1 and efficient proof systems2,3. For technical details, qualified partners and investors may request documentation.
Built on advanced cryptography2 that mathematically proves privacy. We verify you meet requirements without ever learning who you are. It's not just privacy—it's mathematically provable privacy.
Real professionals—bartenders, security staff, retail clerks—verify your credentials in person; take your online privacy to-go from the sources you already trust.
Single API endpoint. Send instance ID, receive boolean response. If it can make HTTP requests, it can integrate with Lockette in under 24 hours. Session-based architecture means users authenticate once and access everything—no per-site verification prompts.
Designed to exceed every privacy regulation worldwide. GDPR-exempt by mathematical design. CCPA-compliant by default. No personal data means no privacy violations—ever.
Authenticate once per session with biometrics or password—then enjoy seamless verification across all age-restricted services. No repeated prompts. No per-site authentication. Your session stays active until you log out or it expires from inactivity. Instance ID never reveals your identity—just your verified status.
Traditional ID verification creates friction that drives users away. Lockette offers verification users actually want to use—privacy-respecting, instant, and secure.
All materials served privacy-respectfully with no tracking or analytics.
Inquiries: inquiry@lockette.dev
Lockette's privacy guarantees are built on decades of cryptographic research. The following academic publications provide the mathematical foundations for Zero-Knowledge proofs and zk-SNARKs.
Goldwasser, Shafi, Silvio Micali, and Charles Rackoff. "The Knowledge Complexity of Interactive Proof Systems." SIAM Journal on Computing 18, no. 1 (1989): 186-208. https://doi.org/10.1137/0218012
The foundational paper introducing Zero-Knowledge proofs, demonstrating how one party can prove knowledge of information without revealing the information itself.
Ben-Sasson, Eli, Alessandro Chiesa, Daniel Genkin, Eran Tromer, and Madars Virza. "SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge." In Advances in Cryptology – CRYPTO 2013, edited by Ran Canetti and Juan A. Garay, 90-108. Berlin: Springer, 2013. https://doi.org/10.1007/978-3-642-40084-1_6
Introduces practical constructions for zk-SNARKs, enabling efficient Zero-Knowledge proofs for general computations.
Groth, Jens. "On the Size of Pairing-Based Non-interactive Arguments." In Advances in Cryptology – EUROCRYPT 2016, edited by Marc Fischlin and Jean-Sébastien Coron, 305-326. Berlin: Springer, 2016. https://doi.org/10.1007/978-3-662-49896-5_11
Presents the most efficient zk-SNARK construction to date, widely used in privacy-preserving applications.
Ben-Sasson, Eli, Alessandro Chiesa, Eran Tromer, and Madars Virza. "Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture." In 23rd USENIX Security Symposium, 781-796. San Diego: USENIX Association, 2014. https://www.usenix.org/conference/usenixsecurity14/technical-sessions/presentation/ben-sasson
Demonstrates practical implementations of zk-SNARKs for real-world computing architectures.
Google Safety Engineering Center. "Opening Up Zero-Knowledge Proof Technology to Promote Privacy in Age Assurance." The Keyword (blog), Google, September 18, 2024. https://blog.google/technology/safety-security/opening-up-zero-knowledge-proof-technology-to-promote-privacy-in-age-assurance/
Industry perspective on applying Zero-Knowledge proof technology to age verification systems, demonstrating real-world deployment considerations for privacy-preserving identity verification.