Eprint

Results: 2085



#Item
1Doubly-efficient zkSNARKs without trusted setup Riad S. Wahby⋆ Ioanna Tzialla◦  abhi shelat†

Doubly-efficient zkSNARKs without trusted setup Riad S. Wahby⋆ Ioanna Tzialla◦ abhi shelat†

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2018-04-19 12:23:03
    2A Bit-fixing PRF with O(1) Collusion-Resistance from LWE Alex Davidson1,? and Ryo Nishimaki2 1  2

    A Bit-fixing PRF with O(1) Collusion-Resistance from LWE Alex Davidson1,? and Ryo Nishimaki2 1 2

    Add to Reading List

    Source URL: eprint.iacr.org

    Language: English - Date: 2018-10-18 18:40:38
    3Designing Proof of Human-work Puzzles for Cryptocurrency and Beyond∗ Jeremiah Blocki Purdue University,  Hong-Sheng Zhou Virginia Commonwealth University,

    Designing Proof of Human-work Puzzles for Cryptocurrency and Beyond∗ Jeremiah Blocki Purdue University, Hong-Sheng Zhou Virginia Commonwealth University,

    Add to Reading List

    Source URL: eprint.iacr.org

    Language: English - Date: 2016-08-24 14:55:21
    4Short Double- and N -Times-Authentication-Preventing Signatures from ECDSA and More David Derler1 , Sebastian Ramacher1 , and Daniel Slamanig2 1

    Short Double- and N -Times-Authentication-Preventing Signatures from ECDSA and More David Derler1 , Sebastian Ramacher1 , and Daniel Slamanig2 1

    Add to Reading List

    Source URL: eprint.iacr.org

    Language: English - Date: 2018-02-28 05:05:12
    5On the Size of Pairing-based Non-interactive Arguments? Jens Groth?? University College London, UK   Abstract. Non-interactive arguments enable a prover to convince a verifier that a statement is true. R

    On the Size of Pairing-based Non-interactive Arguments? Jens Groth?? University College London, UK Abstract. Non-interactive arguments enable a prover to convince a verifier that a statement is true. R

    Add to Reading List

    Source URL: eprint.iacr.org

    Language: English - Date: 2016-05-31 08:55:32
    6Anonymous Attestation with Subverted TPMs  ? Jan Camenisch1 , Manu Drijvers1,2 , and Anja Lehmann1 1

    Anonymous Attestation with Subverted TPMs ? Jan Camenisch1 , Manu Drijvers1,2 , and Anja Lehmann1 1

    Add to Reading List

    Source URL: eprint.iacr.org

    Language: English - Date: 2017-06-28 10:54:34
    7Zero-Knowledge Protocols for Search Problems Ben Berger Zvika Brakerski Weizmann Institute of Science, Israel∗  Abstract

    Zero-Knowledge Protocols for Search Problems Ben Berger Zvika Brakerski Weizmann Institute of Science, Israel∗ Abstract

    Add to Reading List

    Source URL: eprint.iacr.org

    Language: English - Date: 2018-05-14 10:13:17
    8Succinct Spooky Free Compilers Are Not Black Box Sound Zvika Brakerski∗ Yael Kalai†  Renen Perlman‡

    Succinct Spooky Free Compilers Are Not Black Box Sound Zvika Brakerski∗ Yael Kalai† Renen Perlman‡

    Add to Reading List

    Source URL: eprint.iacr.org

    Language: English - Date: 2017-11-17 09:33:06
    9Security Bounds for the NIST Codebook-based Deterministic Random Bit Generator Matthew J. Campagna  Secure Systems Pitney Bowes Inc.

    Security Bounds for the NIST Codebook-based Deterministic Random Bit Generator Matthew J. Campagna Secure Systems Pitney Bowes Inc.

    Add to Reading List

    Source URL: eprint.iacr.org

    Language: English - Date: 2006-11-01 07:43:52
    10Revisiting Proxy Re-Encryption: Forward Secrecy, Improved Security, and Applications David Derler1 , Stephan Krenn2 , Thomas Lor¨ unser2 , Sebastian Ramacher1 , 2 Daniel Slamanig , and Christoph Striecks2

    Revisiting Proxy Re-Encryption: Forward Secrecy, Improved Security, and Applications David Derler1 , Stephan Krenn2 , Thomas Lor¨ unser2 , Sebastian Ramacher1 , 2 Daniel Slamanig , and Christoph Striecks2

    Add to Reading List

    Source URL: eprint.iacr.org

    Language: English - Date: 2018-05-03 11:03:06