Skip to content

Commit

Permalink
re-organize main page
Browse files Browse the repository at this point in the history
  • Loading branch information
curiecrypt committed Feb 3, 2025
1 parent 22bc9bd commit c8b93a2
Show file tree
Hide file tree
Showing 4 changed files with 10 additions and 8 deletions.
6 changes: 6 additions & 0 deletions docs/rustdoc/centralized_telescope/intro.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,6 @@
# Telescope - Construction with Bounded DFS

In scenarios where $n_p$ is small, the parameters given for prehashed construction (relative to the security parameter, $\lambda$) are not optimal, resulting in a reduced probability of constructing a valid proof in a single attempt.
For large $n_p$, the rapid growth in potential proof tuples ensures valid ones can be found efficiently, allowing the prehashed construction to work seamlessly.
In contrast, small $n_p$ limits the search space, making the previous parameters inadequate.
To address this, the **construction with bounded DFS** expands on the prehashed version with *retries*, *prehashing randomization*, and *bounding* the DFS.
7 changes: 0 additions & 7 deletions docs/rustdoc/centralized_telescope/main.md
Original file line number Diff line number Diff line change
@@ -1,10 +1,3 @@
# Telescope - Construction with Bounded DFS

In scenarios where $n_p$ is small, the parameters given for prehashed construction (relative to the security parameter, $\lambda$) are not optimal, resulting in a reduced probability of constructing a valid proof in a single attempt.
For large $n_p$, the rapid growth in potential proof tuples ensures valid ones can be found efficiently, allowing the prehashed construction to work seamlessly.
In contrast, small $n_p$ limits the search space, making the previous parameters inadequate.
To address this, the **construction with bounded DFS** expands on the prehashed version with *retries*, *prehashing randomization*, and *bounding* the DFS.

## Overview
- When $n_p$ is large, the rapid increase in potential proof tuples enhances the chances of finding a valid proof, simplifying the construction process.
- For small $n_p$, the element distribution across bins is more likely to be skewed, some bins may contain multiple elements while others remain empty.
Expand Down
4 changes: 3 additions & 1 deletion src/centralized_telescope/mod.rs
Original file line number Diff line number Diff line change
@@ -1,7 +1,9 @@
//! ALBA's bounded DFS scheme using Blake2b as hash function.
//! (c.f. Section 3.2.2 of Alba paper)
#![doc = include_str!("../../docs/rustdoc/centralized_telescope/main.md")]
#![doc = include_str!("../../docs/rustdoc/centralized_telescope/intro.md")]
//!
//! See full documentation: [Telescope - Construction with Bounded DFS][crate::docs::centralized]
pub mod params;

Expand Down
1 change: 1 addition & 0 deletions src/docs.rs
Original file line number Diff line number Diff line change
Expand Up @@ -11,6 +11,7 @@ pub mod basic {}
#[doc = include_str!("../docs/rustdoc/prehashing.md")]
pub mod prehashing {}

#[doc = include_str!("../docs/rustdoc/centralized_telescope/intro.md")]
#[doc = include_str!("../docs/rustdoc/centralized_telescope/main.md")]
pub mod centralized {
#[doc = include_str!("../docs/rustdoc/centralized_telescope/params.md")]
Expand Down

0 comments on commit c8b93a2

Please sign in to comment.