Search

Search Results

1. Probabilistically Checkable Arguments for All NP

   A probabilistically checkable argument ( \(\textsf{PCA}\)...

   Shany Ben-David in Advances in Cryptology – EUROCRYPT 2024

   Conference paper 2024
   

2. Which Languages Have 4-Round Fully Black-Box Zero-Knowledge Arguments from One-Way Functions?

   We prove that if a language \(\mathcal{L}\) has a...

   Carmit Hazay, Rafael Pass, Muthuramakrishnan Venkitasubramaniam in Advances in Cryptology – EUROCRYPT 2020

   Conference paper 2020
   

3. Characterizing Deterministic-Prover Zero Knowledge

   Randomness is typically thought to be essential for zero knowledge protocols. Following this intuition, Goldreich and Oren (Journal of Cryptology 94)...

   Nir Bitansky, Arka Rai Choudhuri in Theory of Cryptography

   Conference paper 2020
   

4. Zero Knowledge Contingent Payments for Trained Neural Networks

   Nowadays, neural networks have been widely used in many machine learning tasks. In practice, one might not have enough expertise to fine-tune a...

   Zhelei Zhou, **nle Cao, ... Kui Ren in Computer Security – ESORICS 2021

   Conference paper 2021
   

5. More Efficient Amortization of Exact Zero-Knowledge Proofs for LWE

   We propose a practical zero-knowledge proof system for proving knowledge of short solutions...

   Jonathan Bootle, Vadim Lyubashevsky, ... Gregor Seiler in Computer Security – ESORICS 2021

   Conference paper 2021
   

6. BooLigero: Improved Sublinear Zero Knowledge Proofs for Boolean Circuits

   We provide a modified version of the Ligero sublinear zero knowledge proof system for arithmetic circuits provided by Ames et al. (CCS ’17). Our...

   Yaron Gvili, Sarah Scheffler, Mayank Varia in Financial Cryptography and Data Security

   Conference paper 2021
   

7. Shorter Non-interactive Zero-Knowledge Arguments and ZAPs for Algebraic Languages

   We put forth a new framework for building pairing-based non-interactive zero-knowledge (...

   Geoffroy Couteau, Dominik Hartmann in Advances in Cryptology – CRYPTO 2020

   Conference paper 2020
   

8. Zero-Knowledge Proofs for Committed Symmetric Boolean Functions

   Zero-knowledge proofs (ZKP) are a fundamental notion in modern cryptography and an essential building block for countless privacy-preserving...

   San Ling, Khoa Nguyen, ... Huaxiong Wang in Post-Quantum Cryptography

   Conference paper 2021
   

9. A Black-Box Approach to Post-Quantum Zero-Knowledge in Constant Rounds

   In a recent seminal work, Bitansky and Shmueli (STOC ’20) gave the first construction of a constant round zero-knowledge argument for...

   Nai-Hui Chia, Kai-Min Chung, Takashi Yamakawa in Advances in Cryptology – CRYPTO 2021

   Conference paper 2021
   

10. Super-Perfect Zero-Knowledge Proofs

    We initiate a study of super-perfect zero-knowledge proof systems. Loosely speaking, these are proof systems for which the interaction can be...

    Oded Goldreich, Liav Teichner in Computational Complexity and Property Testing

    Chapter 2020
    

11. Secure Computation with Shared EPR Pairs (Or: How to Teleport in Zero-Knowledge)

    Can a sender non-interactively transmit one of two strings to a receiver without knowing which string was received? Does there exist...

    James Bartusek, Dakshita Khurana, Akshayaram Srinivasan in Advances in Cryptology – CRYPTO 2023

    Conference paper 2023
    

12. Public-Coin Statistical Zero-Knowledge Batch Verification Against Malicious Verifiers

    Suppose that a problem \(\varPi \)...

    Inbar Kaslasi, Ron D. Rothblum, Prashant Nalini Vasudevanr in Advances in Cryptology – EUROCRYPT 2021

    Conference paper 2021
    

13. 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
    

14. Fully Succinct Batch Arguments for  \(\textsf{NP}\) from Indistinguishability Obfuscation

    Non-interactive batch arguments for \(\textsf{NP} \)...

    Rachit Garg, Kristin Sheridan, ... David J. Wu in Theory of Cryptography

    Conference paper 2022
    

15. Statistical Concurrent Non-Malleable Zero-Knowledge from One-Way Functions

    Susumu Kiyoshima in Journal of Cryptology

    Article 22 April 2020
    

16. Faster Sounder Succinct Arguments and  \(\textsf{IOP}\) s

    Succinct arguments allow a prover to convince a verifier that a given statement is true, using an extremely short proof. A major bottleneck that has...

    Justin Holmgren, Ron D. Rothblum in Advances in Cryptology – CRYPTO 2022

    Conference paper 2022
    

17. Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge

    An extractable one-way function (EOWF), introduced by Canetti and Dakdouk (ICALP 2008) and generalized by Bitansky et al. (SIAM Journal on Computing...

    Prastudy Fauzi, Helger Lipmaa, ... Arne Tobias Ødegaard in Advances in Cryptology – ASIACRYPT 2021

    Conference paper 2021
    

18. Toward Non-interactive Zero-Knowledge Proofs for NP from LWE

    Ron D. Rothblum, Adam Sealfon, Katerina Sotiraki in Journal of Cryptology

    Article 06 January 2021

19. Compact Zero-Knowledge Proofs for Threshold ECDSA with Trustless Setup

    Threshold ECDSA signatures provide a higher level of security to a crypto wallet since it requires more than t parties out of n parties to sign a...

    Tsz Hon Yuen, Handong Cui, **ang **e in Public-Key Cryptography – PKC 2021

    Conference paper 2021
    

20. Shorter Lattice-Based Zero-Knowledge Proofs for the Correctness of a Shuffle

    In an electronic voting procedure, mixing networks are used to ensure anonymity of the casted votes. Each node of the network re-encrypts the input...

    Javier Herranz, Ramiro Martínez, Manuel Sánchez in Financial Cryptography and Data Security. FC 2021 International Workshops

    Conference paper 2021