Homomorphic signatures for network coding

Results: 15



#Item
1Homomorphic Signatures for Verifiable Computing Advisor(s): Christian Hanser Institute for Applied Information Processing and Communications (IAIK) Graz University of Technology, Austria

Homomorphic Signatures for Verifiable Computing Advisor(s): Christian Hanser Institute for Applied Information Processing and Communications (IAIK) Graz University of Technology, Austria

Add to Reading List

Source URL: www.iaik.tugraz.at

Language: English - Date: 2015-11-30 11:00:03
2Exercises on pairings on elliptic curves Andreas Enge Leuven, Friday, 13 September 2013 Exercise 1 (Weil reciprocity). Let E : Y 2 = X 3 + X over F7 , f = Y , g = X−1 X−3 . Compute div f and div g, and verify that f

Exercises on pairings on elliptic curves Andreas Enge Leuven, Friday, 13 September 2013 Exercise 1 (Weil reciprocity). Let E : Y 2 = X 3 + X over F7 , f = Y , g = X−1 X−3 . Compute div f and div g, and verify that f

Add to Reading List

Source URL: www.cosic.esat.kuleuven.be

Language: English - Date: 2013-09-23 05:41:31
3Verified Indifferentiable Hashing into Elliptic Curves Santiago Zanella B´eguelin1 Gilles Barthe2 , Benjamin Gr´egoire3 , Sylvain Heraud3 and Federico Olmedo2

Verified Indifferentiable Hashing into Elliptic Curves Santiago Zanella B´eguelin1 Gilles Barthe2 , Benjamin Gr´egoire3 , Sylvain Heraud3 and Federico Olmedo2

Add to Reading List

Source URL: certicrypt.gforge.inria.fr

Language: English - Date: 2013-06-17 13:32:36
41  On the Security and Efficiency of Content Distribution Via Network Coding Qiming Li∗ John C.S. Lui+

1 On the Security and Efficiency of Content Distribution Via Network Coding Qiming Li∗ John C.S. Lui+

Add to Reading List

Source URL: www.cs.cuhk.hk

Language: English - Date: 2011-05-19 23:15:34
5Formally Certifying the Security of Digital Signature Schemes Santiago Zanella B´eguelin Benjamin Gr´egoire INRIA Sophia Antipolis - M´editerran´ee Microsoft Research - INRIA Joint Centre {Santiago.Zanella,Benjamin.G

Formally Certifying the Security of Digital Signature Schemes Santiago Zanella B´eguelin Benjamin Gr´egoire INRIA Sophia Antipolis - M´editerran´ee Microsoft Research - INRIA Joint Centre {Santiago.Zanella,Benjamin.G

Add to Reading List

Source URL: certicrypt.gforge.inria.fr

Language: English
6Efficient Network Coding Signatures in the Standard Model Dario Catalano1 , Dario Fiore2? and Bogdan Warinschi3 1 2

Efficient Network Coding Signatures in the Standard Model Dario Catalano1 , Dario Fiore2? and Bogdan Warinschi3 1 2

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2012-03-14 12:17:36
7Encrypting Proofs on Pairings and Its Application to Anonymity for Signatures Georg Fuchsbauer David Pointcheval

Encrypting Proofs on Pairings and Its Application to Anonymity for Signatures Georg Fuchsbauer David Pointcheval

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2008-12-17 12:32:39
8Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures Dan Boneh and David Mandell Freeman Stanford University, USA

Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures Dan Boneh and David Mandell Freeman Stanford University, USA

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2011-04-01 18:52:46
9Cryptographic hash Functions from Expander Graphs

Cryptographic hash Functions from Expander Graphs

Add to Reading List

Source URL: csrc.nist.gov

Language: English - Date: 2012-06-20 09:47:28
101  The Benefits of Coding over Routing in a Randomized Setting Tracey Ho, Ralf Koetter, Muriel M´edard, David R. Karger and Michelle Effros Abstract— We present a novel randomized coding approach for robust, distribut

1 The Benefits of Coding over Routing in a Randomized Setting Tracey Ho, Ralf Koetter, Muriel M´edard, David R. Karger and Michelle Effros Abstract— We present a novel randomized coding approach for robust, distribut

Add to Reading List

Source URL: www.its.caltech.edu

Language: English - Date: 2004-02-06 18:44:16