Eprint

Results: 2085



#Item
241

Publicly Verifiable Delegation of Large Polynomials and Matrix Computations, with Applications Dario Fiore1 and Rosario Gennaro2? 1 Department of Computer Science, New York University, USA

Add to Reading List

Source URL: eprint.iacr.org

- Date: 2012-07-23 10:44:48
    242

    The Right Way to Search Evolving Graphs Jiahao Chen and Weijian Zhang January 2016 MIMS EPrint: 2016.7

    Add to Reading List

    Source URL: eprints.ma.man.ac.uk

    - Date: 2016-01-29 12:39:50
      243

      Optimizing Obfuscation: Avoiding Barrington’s Theorem † Prabhanjan Ananth Department of Computer Science and Center for Encrypted Functionalities,

      Add to Reading List

      Source URL: eprint.iacr.org

      - Date: 2014-09-29 14:03:08
        244

        David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware Tal Moran∗ Gil Segev∗

        Add to Reading List

        Source URL: eprint.iacr.org

        - Date: 2008-01-31 10:30:41
          245

          From Selective to Adaptive Security in Functional Encryption Prabhanjan Ananth∗ UCLA Zvika Brakerski†

          Add to Reading List

          Source URL: eprint.iacr.org

          - Date: 2015-02-16 17:56:27
            246

            One-Way Functions and (Im)perfect Obfuscation∗ Ilan Komargodski† Tal Moran‡ Moni Naor†

            Add to Reading List

            Source URL: eprint.iacr.org

            - Date: 2016-07-20 05:44:28
              247

              Lattice-Based Fully Dynamic Multi-Key FHE with Short Ciphertexts Zvika Brakerski∗ Renen Perlman†

              Add to Reading List

              Source URL: eprint.iacr.org

              - Date: 2016-11-18 04:38:48
                248

                Can PPAD Hardness be Based on Standard Cryptographic Assumptions? Alon Rosen∗ Gil Segev†

                Add to Reading List

                Source URL: eprint.iacr.org

                - Date: 2016-11-02 14:33:31
                  249

                  Order-Revealing Encryption: New Constructions, Applications, and Lower Bounds (Extended Version) Kevin Lewi Stanford University

                  Add to Reading List

                  Source URL: eprint.iacr.org

                  - Date: 2016-08-08 15:12:50
                    250

                    Message-Locked Encryption for Lock-Dependent Messages Mart´ın Abadi1,3 , Dan Boneh2,? , Ilya Mironov1 , Ananth Raghunathan2,?,?? , and Gil Segev2,?,?? 1

                    Add to Reading List

                    Source URL: eprint.iacr.org

                    - Date: 2015-05-07 11:56:24
                      UPDATE