Reference. SNARKBlock: Federated Anonymous Blocklisting from Hidden Common Input Aggregate Proofs
Cite
Cites 47 works (0 here)
External (47)
- Halo Infinite: Proof-Carrying Data from Additive Polynomial Commitments (2021)
- Proof-Carrying Data Without Succinct Arguments (2021)
- Nova: Recursive zero-knowledge arguments from folding schemes (2021)
- SNARKBlock: Federated anonymous blocklisting from hidden common input aggregate proofs (Cryptology ePrint Archive 2021/1577) (2021)
- Arkworks Ecosystem Homepage (2021)
- Advances in Cryptology – CRYPTO 2021, Part I (LNCS 12825) (2021)
- Help Center - What names are allowed on Facebook? (2021)
- Proofs for inner pairing products and applications (2020)
- Another look at extraction and randomization of Groth’s zk-SNARK (2020)
- Reducing participation costs via incremental verification for ledger systems (2020)
- Dynamic universal accumulator with batch update over bilinear groups (2020)
- Proof-carrying data from accumulation schemes (2020)
- Reddit in 2020 (2020)
- Halo: Recursive proof composition without a trusted setup (2019)
- Zero-knowledge proofs for set membership: Efficient, succinct, modular (2019)
- Efficient Zero-Knowledge Arguments in the Discrete Log Setting, Revisited (2019)
- Starkad and Poseidon: New hash functions for zero knowledge proof systems (2019)
- Facebook pays the reviewers filtering porn and murder a tiny fraction of its median salary, explosive report says (2019)
- What is Jubjub? (2019)
- DIZK: A distributed zero knowledge proof system (2018)
- Bulletproofs: Short Proofs for Confidential Transactions and More (2018)
- The Algebraic Group Model and its Applications (2018)
- Internet access services (2018)
- Scalable multi-party computation for zk-SNARK parameters in the random beacon model (2017)
- Accumulators with applications to anonymity-preserving revocation (2017)
- Subversion-zero-knowledge SNARKs (2017)
- BLS12-381: New zk-SNARK Elliptic Curve Construction (2017)
- On the size of pairing-based non-interactive arguments (2016)
- Secure Sampling of Public Parameters for Succinct Zero Knowledge Proofs (2015)
- Zero-Knowledge Argument for Polynomial Evaluation with Application to Blacklists (2013)
- Formalizing Anonymous Blacklisting Systems (2011)
- BLAC: Revoking Repeatedly Misbehaving Anonymous Users without Relying on TTPs (2010)
- Jack: Scalable accumulator-based Nymble system (2010)
- Nymble: Blocking Misbehaving Users in Anonymizing Networks (2009)
- PEREA: towards practical TTP-free revocation in anonymous authentication (2008)
- Universal accumulators with efficient nonmembership proofs (2007)
- Nymble: Anonymous IP-Address Blocking (2007)
- Short group signatures (2004)
- Short signatures without random oracles (2004)
- Foundations of Group Signatures: Formal Definitions, Simplified Requirements, and a Construction Based on General Assumptions (2003)
- Practical verifiable encryption and decryption of discrete logarithms (2003)
- Dynamic accumulators and application to efficient revocation of anonymous credentials (2002)
- Proof systems for general statements about discrete logarithms (1997)
- Group Signatures (1991)
- How to prove yourself: Practical solutions to identification and signature problems (1987)
- Security without identification: transaction systems to make big brother obsolete (1985)
- PBC library - pairing-based cryptography