mirror of
https://github.com/privacy-scaling-explorations/pse.dev.git
synced 2026-04-23 03:01:03 -04:00
feat: update projects copy (#304)
This commit is contained in:
@@ -1,16 +1,15 @@
|
||||
import { ProjectInterface, ProjectStatus } from "@/lib/types"
|
||||
import { ProjectInterface, ProjectStatus } from '@/lib/types'
|
||||
|
||||
export const machinaIo: ProjectInterface = {
|
||||
id: "machina_io",
|
||||
image: "",
|
||||
name: "MachinaIO",
|
||||
section: "pse",
|
||||
id: 'machina_io',
|
||||
image: '',
|
||||
name: 'MachinaIO',
|
||||
section: 'pse',
|
||||
projectStatus: ProjectStatus.ACTIVE,
|
||||
content: {
|
||||
en: {
|
||||
tldr: "Building the first practical indistinguishability obfuscation (iO) system for secure and scalable cryptographic applications.",
|
||||
tldr: 'Building the first practical indistinguishability obfuscation (iO) system for secure and scalable cryptographic applications.',
|
||||
description: `
|
||||
## MachinaIO
|
||||
### Towards Practical Indistinguishability Obfuscation (iO)
|
||||
|
||||
MachinaIO aims to create the first *practical* iO system based on formal security proofs, transforming any program into a black-box that hides its internals while preserving its functionality. By replacing committees in multi-party computation (MPC) or multi-key fully homomorphic encryption (FHE), iO can scale these applications securely and eliminate trust bottlenecks.
|
||||
@@ -32,9 +31,21 @@ Led by two cryptography researchers (*Sora* and *Enrico*), MachinaIO welcomes ad
|
||||
},
|
||||
},
|
||||
tags: {
|
||||
keywords: ["indistinguishability obfuscation", "iO", "cryptography", "Ethereum", "FHE", "SNARKs"],
|
||||
themes: ["cryptography", "privacy", "scalability"],
|
||||
types: ["research", "development"],
|
||||
builtWith: ["FHE", "SNARKs", "functional encryption", "lattice cryptography"],
|
||||
keywords: [
|
||||
'indistinguishability obfuscation',
|
||||
'iO',
|
||||
'cryptography',
|
||||
'Ethereum',
|
||||
'FHE',
|
||||
'SNARKs',
|
||||
],
|
||||
themes: ['cryptography', 'privacy', 'scalability'],
|
||||
types: ['research', 'development'],
|
||||
builtWith: [
|
||||
'FHE',
|
||||
'SNARKs',
|
||||
'functional encryption',
|
||||
'lattice cryptography',
|
||||
],
|
||||
},
|
||||
}
|
||||
|
||||
@@ -1,16 +1,15 @@
|
||||
import { ProjectInterface, ProjectStatus } from "@/lib/types"
|
||||
import { ProjectInterface, ProjectStatus } from '@/lib/types'
|
||||
|
||||
export const plasmaFold: ProjectInterface = {
|
||||
id: "plasma_fold",
|
||||
image: "",
|
||||
name: "Plasma Fold",
|
||||
section: "pse",
|
||||
id: 'plasma_fold',
|
||||
image: '',
|
||||
name: 'Plasma Fold',
|
||||
section: 'pse',
|
||||
projectStatus: ProjectStatus.ACTIVE,
|
||||
content: {
|
||||
en: {
|
||||
tldr: "Integrating folding schemes into plasma-based L2 solutions for efficient and scalable Ethereum transactions.",
|
||||
tldr: 'Integrating folding schemes into plasma-based L2 solutions for efficient and scalable Ethereum transactions.',
|
||||
description: `
|
||||
## Plasma Fold
|
||||
### Leveraging Folding Schemes for Efficient L2 Solutions
|
||||
|
||||
Our project builds on the external [intmax](https://www.intmax.io/) design by integrating folding schemes into their plasma-based L2 approach. While intmax uses client-side validation with minimal on-chain data and validity proofs to achieve high throughput, its reliance on resource-intensive proving can strain low-end devices. Folding schemes—with low recursive overhead and minimal memory usage—offer a powerful solution to streamline this process.
|
||||
@@ -35,9 +34,16 @@ Our goal is to design and benchmark a client-friendly zk/plasma scaling solution
|
||||
},
|
||||
},
|
||||
tags: {
|
||||
keywords: ["plasma", "folding schemes", "Ethereum", "scalability", "L2", "zero-knowledge proofs"],
|
||||
themes: ["scalability", "L2 solutions", "zk proofs"],
|
||||
types: ["research", "development"],
|
||||
builtWith: ["plasma", "zk proofs", "folding schemes"],
|
||||
keywords: [
|
||||
'plasma',
|
||||
'folding schemes',
|
||||
'Ethereum',
|
||||
'scalability',
|
||||
'L2',
|
||||
'zero-knowledge proofs',
|
||||
],
|
||||
themes: ['scalability', 'L2 solutions', 'zk proofs'],
|
||||
types: ['research', 'development'],
|
||||
builtWith: ['plasma', 'zk proofs', 'folding schemes'],
|
||||
},
|
||||
}
|
||||
|
||||
@@ -1,17 +1,15 @@
|
||||
import { ProjectInterface, ProjectStatus } from "@/lib/types"
|
||||
import { ProjectInterface, ProjectStatus } from '@/lib/types'
|
||||
|
||||
export const postQuantumCryptography: ProjectInterface = {
|
||||
id: "post_quantum_cryptography",
|
||||
image: "",
|
||||
name: "Post-Quantum Cryptography and Ethereum",
|
||||
section: "pse",
|
||||
id: 'post_quantum_cryptography',
|
||||
image: '',
|
||||
name: 'Post-Quantum Cryptography and Ethereum',
|
||||
section: 'pse',
|
||||
projectStatus: ProjectStatus.ACTIVE,
|
||||
content: {
|
||||
en: {
|
||||
tldr: "Ensuring Ethereum's cryptographic security against future quantum threats.",
|
||||
description: `
|
||||
## Post-Quantum Cryptography and Ethereum
|
||||
|
||||
Post-quantum cryptography (PQC) is crucial for securing digital communication against future quantum computers, which threaten to break widely used cryptographic schemes such as RSA, ECC, and DSA. A smooth transition to PQC requires careful consideration of performance trade-offs, compatibility with existing protocols, and resilience against potential future attacks.
|
||||
|
||||
### The Importance of PQC for Ethereum
|
||||
@@ -45,9 +43,14 @@ At PSE, we are committed to staying at the forefront of the rapidly evolving fie
|
||||
},
|
||||
},
|
||||
tags: {
|
||||
keywords: ["post-quantum cryptography", "Ethereum", "security", "cryptography"],
|
||||
themes: ["cryptography", "security"],
|
||||
types: ["research", "development"],
|
||||
builtWith: ["ECC", "PQC", "zero-knowledge proofs"],
|
||||
keywords: [
|
||||
'post-quantum cryptography',
|
||||
'Ethereum',
|
||||
'security',
|
||||
'cryptography',
|
||||
],
|
||||
themes: ['cryptography', 'security'],
|
||||
types: ['research', 'development'],
|
||||
builtWith: ['ECC', 'PQC', 'zero-knowledge proofs'],
|
||||
},
|
||||
}
|
||||
|
||||
@@ -1,17 +1,15 @@
|
||||
import { ProjectInterface, ProjectStatus } from "@/lib/types"
|
||||
import { ProjectInterface, ProjectStatus } from '@/lib/types'
|
||||
|
||||
export const vOPRF: ProjectInterface = {
|
||||
id: "web2_id_nullifiers",
|
||||
image: "",
|
||||
name: "Web2-ID Nullifiers using vOPRF",
|
||||
section: "pse",
|
||||
id: 'web2_id_nullifiers',
|
||||
image: '',
|
||||
name: 'Web2-ID Nullifiers using vOPRF',
|
||||
section: 'pse',
|
||||
projectStatus: ProjectStatus.ACTIVE,
|
||||
content: {
|
||||
en: {
|
||||
tldr: "Enabling pseudonymous systems for Web2 identities using verifiable Oblivious PseudoRandom Functions (vOPRFs).",
|
||||
tldr: 'Enabling pseudonymous systems for Web2 identities using verifiable Oblivious PseudoRandom Functions (vOPRFs).',
|
||||
description: `
|
||||
## Web2-ID Nullifiers using vOPRF
|
||||
|
||||
### Overview
|
||||
|
||||
The Web2-ID Nullifiers project enables **pseudonymous systems for Web2 identities** using verifiable Oblivious PseudoRandom Functions (vOPRFs). It addresses the lack of **nullifiers** in Web2 IDs, which are essential for anonymous protocols. The project aims to build an infrastructure, like Semaphore, for Web2-ID registration and reuse across applications.
|
||||
@@ -52,9 +50,9 @@ The Web2-ID Nullifiers project enables **pseudonymous systems for Web2 identitie
|
||||
},
|
||||
},
|
||||
tags: {
|
||||
keywords: ["vOPRF", "nullifiers", "Web2", "privacy", "ZK proofs", "MPC"],
|
||||
themes: ["privacy", "identity", "zero-knowledge proofs"],
|
||||
types: ["research", "development"],
|
||||
builtWith: ["vOPRF", "MPC", "ZK proofs"],
|
||||
keywords: ['vOPRF', 'nullifiers', 'Web2', 'privacy', 'ZK proofs', 'MPC'],
|
||||
themes: ['privacy', 'identity', 'zero-knowledge proofs'],
|
||||
types: ['research', 'development'],
|
||||
builtWith: ['vOPRF', 'MPC', 'ZK proofs'],
|
||||
},
|
||||
}
|
||||
|
||||
Reference in New Issue
Block a user