We are improving our search experience. To check which content you have full access to, or for advanced search, go back to the old search.

Search

Please fill in this field.
Filters applied:
Computer science

Search Results

Showing 1-20 of 8,222 results

  1. Set (Non-)Membership NIZKs from Determinantal Accumulators

    We construct a falsifiable set (non-)membership NIZK \(\mathbf {\Pi ^*}\)...
    Helger Lipmaa, Roberto Parisella in Progress in Cryptology – LATINCRYPT 2023
    Conference paper 2023

  2. Zero-knowledge proofs for set membership: efficient, succinct, modular

    We consider the problem of proving in zero knowledge that an element of a public set satisfies a given property without disclosing the element, i.e.,...

    Daniel Benarroch, Matteo Campanelli, ... Dimitris Kolonelos in Designs, Codes and Cryptography
    Article Open access 01 July 2023

  3. Cryptographic Accumulators: New Definitions, Enhanced Security, and Delegatable Proofs

    Cryptographic accumulators, introduced in 1993 by Benaloh and De Mare, represent a set with a concise value and offer proofs of (non-)membership....
    Anaïs Barthoulot, Olivier Blazy, Sébastien Canard in Progress in Cryptology - AFRICACRYPT 2024
    Conference paper 2024

  4. Non-interactive Zero-Knowledge Functional Proofs

    In this paper, we consider to generalize NIZK by empowering a prover to share a witness in a fine-grained manner with verifiers. Roughly, the prover...
    Gongxian Zeng, Junzuo Lai, ... Jian Weng in Advances in Cryptology – ASIACRYPT 2023
    Conference paper 2023

  5. Authenticated Multi-proxy Accumulation Schemes for Delegated Membership Proofs

    Proving ownership (or possibly non-ownership) of an attribute associated with an individual or device can be used in many different use cases. For a...
    Hannes Salin, Dennis Fokin, Alexander Johansson in Risks and Security of Internet and Systems
    Conference paper 2022

  6. Vector Commitments with Proofs of Smallness: Short Range Proofs and More

    Vector commitment schemes are compressing commitments to vectors that make it possible to succinctly open a commitment for individual vector...
    Benoît Libert in Public-Key Cryptography – PKC 2024
    Conference paper 2024

  7. Mixed membership distribution-free model

    We consider the problem of community detection in overlap** weighted networks, where nodes can belong to multiple communities and edge weights can...

    Huan Qing, **gli Wang in Knowledge and Information Systems
    Article 27 November 2023

  8. Bulletproofs++: Next Generation Confidential Transactions via Reciprocal Set Membership Arguments

    Zero-knowledge proofs are a cryptographic cornerstone of privacy-preserving technologies such as “Confidential Transactions” (CT), which aims at...
    Liam Eagen, Sanket Kanjalkar, ... Jonas Nick in Advances in Cryptology – EUROCRYPT 2024
    Conference paper 2024

  9. Zero-Knowledge Proofs for Set Membership: Efficient, Succinct, Modular

    We consider the problem of proving in zero knowledge that an element of a public set satisfies a given property without disclosing the element, i.e.,...
    Daniel Benarroch, Matteo Campanelli, ... Dimitris Kolonelos in Financial Cryptography and Data Security
    Conference paper 2021

  10. Systematization of knowledge: privacy methods and zero knowledge proofs in corporate blockchains

    Nowadays enterprises implement blockchain technology in various industries, including finance, logistics, and other sectors. While the core idea...

    Anatoly Konkin, Sergey Zapechnikov in Journal of Computer Virology and Hacking Techniques
    Article 04 March 2023

  11. Mechanical certification of FOLID cyclic proofs

    Cyclic induction is a powerful reasoning technique that consists in blocking the proof development of certain subgoals already encountered during the...

    Sorin Stratulat in Annals of Mathematics and Artificial Intelligence
    Article 16 February 2023

  12. Improved Algorithms for Minimum-Membership Geometric Set Cover

    Bandyapadhyay et al. introduced the generalized minimum-membership geometric set cover (GMMGSC) problem [SoCG, 2023], which is defined as follows: We...
    Sathish Govindarajan, Siddhartha Sarkar in Algorithms and Discrete Applied Mathematics
    Conference paper 2024

  13. CompactChain: an efficient stateless chain for UTXO-model blockchain

    In this work, we propose a stateless blockchain called CompactChain, which compacts the entire state of the UTXO (Unspent Transaction Output) based...

    B. Swaroopa Reddy, T. Uday Kiran Reddy in Frontiers of Computer Science
    Article 22 January 2024

  14. Parameterized Complexity of Minimum Membership Dominating Set

    Akanksha Agrawal, Pratibha Choudhary, ... Vijayaragunathan Ramamoorthi in Algorithmica
    Article 13 June 2023

  15. Oblivious Accumulators

    A cryptographic accumulator is a succinct set commitment scheme with efficient (non-)membership proofs that typically supports updates (additions and...
    Foteini Baldimtsi, Ioanna Karantaidou, Srinivasan Raghuraman in Public-Key Cryptography – PKC 2024
    Conference paper 2024

  16. Making the Interval Membership Width of Temporal Graphs Connected and Bidirectional

    Temporal graphs are graphs that evolve over time. Many problems which are polynomial-time solvable in standard graphs become NP-hard when...
    Filippos Christodoulou, Pierluigi Crescenzi, ... Dimitrios M. Thilikos in Combinatorial Algorithms
    Conference paper 2024

  17. Malleable Commitments from Group Actions and Zero-Knowledge Proofs for Circuits Based on Isogenies

    Zero-knowledge proofs for NP statements are an essential tool for building various cryptographic primitives and have been extensively studied in...
    Mingjie Chen, Yi-Fu Lai, ... Christophe Petit in Progress in Cryptology – INDOCRYPT 2023
    Conference paper 2024

  18. Speed-Stacking: Fast Sublinear Zero-Knowledge Proofs for Disjunctions

    Building on recent compilers for efficient disjunctive composition (e.g. an OR of multiple clauses) of zero-knowledge proofs (e.g. Goel et al....
    Aarushi Goel, Mathias Hall-Andersen, ... Nicholas Spooner in Advances in Cryptology – EUROCRYPT 2023
    Conference paper 2023

  19. Subgroup membership testing on elliptic curves via the Tate pairing

    This note explains how to guarantee the membership of a point in the prime-order subgroup of an elliptic curve (over a finite field) satisfying some...

    Dmitrii Koshelev in Journal of Cryptographic Engineering
    Article 02 September 2022

  20. Membership Checking in Pedigree Polytopes

    This chapter is the heart of the study undertaken in this book. We study the membership problem for pedigree polytope, that is, given an X in the...
    Tirukkattuppalli Subramanyam Arthanari in Pedigree Polytopes
    Chapter 2023
Did you find what you were looking for? Share feedback.