Results 1 - 10 of 19

Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles). In: Dwork

by Xavier Boyen , Brent Waters - CRYPTO 2006. LNCS, , 2006
"... Abstract We present an identity-based cryptosystem that features fully anonymous ciphertexts and hierarchical key delegation. We give a proof of security in the standard model, based on the mild Decision Linear complexity assumption in bilinear groups. The system is efficient and practical, with sm ..."
Abstract - Cited by 119 (10 self) - Add to MetaCart
to cancel out. Since the proof of semantic security is based on the fact that C 2 is indistinguishable from random without the private key for ID, it follows that the scheme is also anonymous since C 2 is the only part of the ciphertext on which the recipient identity has any bearing. More recently

Efficient (Anonymous) Compact HIBE From Standard Assumptions

by Somindu C. Ramanna, Palash Sarkar
"... Abstract. We present two hierarchical identity-based encryption (HIBE) schemes, denoted as H1 and H2, from Type-3 pairings with constant sized ciphertexts. Scheme H1 achieves anonymity while H2 is non-anonymous. The constructions are obtained by extending the IBE scheme recently proposed by Jutla an ..."
Abstract - Add to MetaCart
and Roy (Asiacrypt 2013). Security is based on the standard decisional Symmetric eXternal Diffie-Hellman (SXDH) assumption. In terms of provable security properties, previous direct constructions of constant-size ciphertext HIBE had one or more of the following drawbacks: security in the weaker model

APractical Lattice-based Digital Signature Schemes

by unknown authors
"... Digital signatures are an important primitive for building secure systems and are used in most real world security protocols. However, almost all popular signature schemes are either based on the factoring as-sumption (RSA) or the hardness of the discrete logarithm problem (DSA/ECDSA). In the case o ..."
Abstract - Add to MetaCart
Digital signatures are an important primitive for building secure systems and are used in most real world security protocols. However, almost all popular signature schemes are either based on the factoring as-sumption (RSA) or the hardness of the discrete logarithm problem (DSA/ECDSA). In the case

Supervised by

by Aleksandar Velikov, Prof Dr. Johannes Buchmann, Richard Lindner Acknowledgements , 2007
"... I would like to thank my parents for always believing in me. I would also like to thank my supervisors Richard Lindner and Johannes Buchmann for their useful comments and suggestions on how to improve the queality of the thesis. Not on last place I would like to thank Vadim Lyubashevsky and Luis Car ..."
Abstract - Add to MetaCart
Carlos Coronado Garcia for their kindness and readiness to answer my questions. Warranty I hereby warrant that the content of this thesis is the direct result of my own work and that any use made in it of published or unpublished material is fully and correctly referenced. I also warrant

Contents

by Maxwell Krohn, Michael O. Rabin, Michael Mitzenmacher , 1999
"... 1.1 Private and Public Key Cryptography..................... 5 ..."
Abstract - Add to MetaCart
1.1 Private and Public Key Cryptography..................... 5

On the Definitions of Cryptographic Security: Chosen-Ciphertext Attack Revisited

by unknown authors , 1999
"... ..."
Abstract - Add to MetaCart
Abstract not found

2 1 A CCA2 Secure Variant of the McEliece

by Rafael Dowsley, Anderson C. A. Nascimento
"... ar ..."
Abstract - Add to MetaCart
Abstract not found

Akademisk avhandling för teknisk doktorsexamen vid

by Kungl Tekniska Högskolan, Kth Tryck , 1994
"... mcmxciv This thesis deals with combinatorics in connection with Coxeter groups, finitely generated but not necessarily finite. The representation theory of groups as nonsingular matrices over a field is of immense theoretical importance, but also basic for computational group theory, where the group ..."
Abstract - Add to MetaCart
the group elements are data structures in a computer. Matrices are unnecessarily large structures, and part of this thesis is concerned with small and efficient representations of a large class of Coxeter groups (including most Coxeter groups that anyone ever payed any attention to.) The main contents

PDF hosted at the Radboud Repository of the Radboud University

by Completions Of A Poset, Mai Gehrke, Ramon Jansana, Alessandra Palmigiano
"... Please be advised that this information was generated on 2016-05-12 and may be subject to change. ..."
Abstract - Add to MetaCart
Please be advised that this information was generated on 2016-05-12 and may be subject to change.

ii List of Publications

by Vom Fachbereich Informatik Der, Technischen Universität Darmstadt Genehmigte, Referenten Prof, Dr. Johannes Buchmann, Tag Der Mündlichen Prüfung, Hochschulkennziffer D, Denise Demirel, Maria Henning, Jeroen Van De Graaf, Peter Y. A. Ryan, Johannes Buchmann, In Vote-id, Th International Conference , 2014
"... pages 156–175, 2013. [2] Johannes Buchmann, Denise Demirel, and Jeroen van de Graaf. Towards a publicly-verifiable mix-net providing everlasting privacy. In Financial Cryptog-raphy, pages 197–204, 2013. [3] Denise Demirel, Jeroen van de Graaf, and Roberto Araùjo. Improving helios ..."
Abstract - Add to MetaCart
pages 156–175, 2013. [2] Johannes Buchmann, Denise Demirel, and Jeroen van de Graaf. Towards a publicly-verifiable mix-net providing everlasting privacy. In Financial Cryptog-raphy, pages 197–204, 2013. [3] Denise Demirel, Jeroen van de Graaf, and Roberto Araùjo. Improving helios
Results 1 - 10 of 19