Signatures on randomizable ciphertexts

For more info about our services contact : help@bestpfe.com

Table of contents

1 Introduction 
1.1 Context
1.2 State of the art
1.3 Our results
2 Preliminaries 
2.1 Notations
2.2 Security Model
2.3 Computational assumptions
2.4 Primitives used
2.5 Proof of Lemma 2.9
3 Classification of computational assumptions in the algebraic group model 
3.1 The Uber-Assumption Family
3.2 The Flexible Uber Assumption
3.3 The Ruber Assumption
3.4 The Ruber Assumption for Flexible Targets
3.5 Uber Assumptions with Decisional Oracles
3.6 The Flexible Gegenuber Assumption
3.7 Separation of (q + 1)-DL from q-DL
3.8 Separation of 2-One-More DL from q-DL
3.9 Running Time of the Generic Reduction of Theorem 3.5
3.10 Proof of Theorem 3.9
3.11 Proof of Theorem 3.14
4 Signatures on randomizable ciphertexts 
4.1 Definitions
4.2 Instantiation
4.3 Security of our scheme
5 Transferable E-cash: A Cleaner Model and the First Practical Instantiation 
5.1 Security Models
5.2 Comparison with previous work
5.3 Instantiation
5.4 Instantiation of the building blocks and efficiency
Bibliography 
A.1 Security proofs for the transferable e-cash scheme
A.2 Instantiation of the new blocks
A.3 Efficiency analysis of the transferable e-cash scheme