Homomorphic Signature Schemes

Homomorphic Signature Schemes PDF Author: Giulia Traverso
Publisher: Springer
ISBN: 3319321153
Category : Computers
Languages : en
Pages : 73

Get Book Here

Book Description
Homomorphic signature schemes are an important primitive for many applications and since their introduction numerous solutions have been presented. Thus, in this work we provide the first exhaustive, complete, and up-to-date survey about the state of the art of homomorphic signature schemes. First, the general framework where homomorphic signatures are defined is described and it is shown how the currently available types of homomorphic signatures can then be derived from such a framework. In addition, this work also presents a description of each of the schemes presented so far together with the properties it provides. Furthermore, three use cases, electronic voting, smart grids, and electronic health records, where homomorphic signature schemes can be employed are described. For each of these applications the requirements that a homomorphic signature scheme should fulfill are defined and the suitable schemes already available are listed. This also highlights the shortcomings of current solutions. Thus, this work concludes with several ideas for future research in the direction of homomorphic signature schemes.

Homomorphic Signature Schemes

Homomorphic Signature Schemes PDF Author: Giulia Traverso
Publisher: Springer
ISBN: 3319321153
Category : Computers
Languages : en
Pages : 73

Get Book Here

Book Description
Homomorphic signature schemes are an important primitive for many applications and since their introduction numerous solutions have been presented. Thus, in this work we provide the first exhaustive, complete, and up-to-date survey about the state of the art of homomorphic signature schemes. First, the general framework where homomorphic signatures are defined is described and it is shown how the currently available types of homomorphic signatures can then be derived from such a framework. In addition, this work also presents a description of each of the schemes presented so far together with the properties it provides. Furthermore, three use cases, electronic voting, smart grids, and electronic health records, where homomorphic signature schemes can be employed are described. For each of these applications the requirements that a homomorphic signature scheme should fulfill are defined and the suitable schemes already available are listed. This also highlights the shortcomings of current solutions. Thus, this work concludes with several ideas for future research in the direction of homomorphic signature schemes.

Pairing-Based Cryptography – Pairing 2008

Pairing-Based Cryptography – Pairing 2008 PDF Author: Steven D. Galbraith
Publisher: Springer Science & Business Media
ISBN: 3540855033
Category : Computers
Languages : en
Pages : 386

Get Book Here

Book Description
This book constitutes the thoroughly refereed proceedings of the Second International Conference on Pairing-Based Cryptography, Pairing 2008, held in London, UK, in September 2008. The 20 full papers, presented together with the contributions resulting from 3 invited talks, were carefully reviewed and selected from 50 submissions. The contents are organized in topical sections on cryptography, mathematics, constructing pairing-friendly curves, implementation of pairings, and hardware implementation.

Advances in Cryptology – EUROCRYPT ’96

Advances in Cryptology – EUROCRYPT ’96 PDF Author: Ueli Maurer
Publisher: Springer
ISBN: 3540683399
Category : Computers
Languages : en
Pages : 429

Get Book Here

Book Description
The EUROCRYPT ’96 conference was sponsored by the International Asso- ation for Cryptologic Research (IACR)l, in cooperation with the University of Saragossa. It took place at the Palacio de Congresos in Saragossa, Spain, during May 12-16, 1996. This was the fifteenth annual EUROCRYPT conference (this name has been used since the third conference held in 1984), each of which has been held in a different city in Europe. For the second time, proceedings were available at the conference. JosC Pastor Franco, the General Chair, was resp- sible for local organization and registration. His contribution to the snccess of the conference is gratefully acknowledged. The Program Committee considered 126 submitted papers and selected 34 for presentation. Each paper was sent to all members of the Program Committee and was assigned to at least three of them for careful evaluation. There were also two invited talks. James L. Massey, this year’s IACR Distinguished Ltcturer, gave a lecture entitled “The difficulty with difficulty”. Massey is the third to receive this honor, the first two being Gustavus Simmons and Adi Shamir. Shafi Goldwasser gave an invited talk entitled “Multi party secure protocols: past and present”. These proceedings contain revised versions of the 34 contributed talks. While the papers were carefully selected, they have not been refereed like submissions to a refereed journal. The authors bear full responsibility for the contents of their papers. Some authors may write final versions of their papers for publication in a refereed journal.

Complexity of Lattice Problems

Complexity of Lattice Problems PDF Author: Daniele Micciancio
Publisher: Springer Science & Business Media
ISBN: 1461508975
Category : Computers
Languages : en
Pages : 229

Get Book Here

Book Description
Lattices are geometric objects that can be pictorially described as the set of intersection points of an infinite, regular n-dimensional grid. De spite their apparent simplicity, lattices hide a rich combinatorial struc ture, which has attracted the attention of great mathematicians over the last two centuries. Not surprisingly, lattices have found numerous ap plications in mathematics and computer science, ranging from number theory and Diophantine approximation, to combinatorial optimization and cryptography. The study of lattices, specifically from a computational point of view, was marked by two major breakthroughs: the development of the LLL lattice reduction algorithm by Lenstra, Lenstra and Lovasz in the early 80's, and Ajtai's discovery of a connection between the worst-case and average-case hardness of certain lattice problems in the late 90's. The LLL algorithm, despite the relatively poor quality of the solution it gives in the worst case, allowed to devise polynomial time solutions to many classical problems in computer science. These include, solving integer programs in a fixed number of variables, factoring polynomials over the rationals, breaking knapsack based cryptosystems, and finding solutions to many other Diophantine and cryptanalysis problems.

Algorithmic Strategies for Solving Complex Problems in Cryptography

Algorithmic Strategies for Solving Complex Problems in Cryptography PDF Author: Balasubramanian, Kannan
Publisher: IGI Global
ISBN: 1522529160
Category : Computers
Languages : en
Pages : 321

Get Book Here

Book Description
Cryptography is a field that is constantly advancing, due to exponential growth in new technologies within the past few decades. Applying strategic algorithms to cryptic issues can help save time and energy in solving the expanding problems within this field. Algorithmic Strategies for Solving Complex Problems in Cryptography is an essential reference source that discusses the evolution and current trends in cryptology, and it offers new insight into how to use strategic algorithms to aid in solving intricate difficulties within this domain. Featuring relevant topics such as hash functions, homomorphic encryption schemes, two party computation, and integer factoring, this publication is ideal for academicians, graduate students, engineers, professionals, and researchers interested in expanding their knowledge of current trends and techniques within the cryptology field.

Information Theory and Network Coding

Information Theory and Network Coding PDF Author: Raymond W. Yeung
Publisher: Springer Science & Business Media
ISBN: 0387792333
Category : Computers
Languages : en
Pages : 592

Get Book Here

Book Description
This book is an evolution from my book A First Course in Information Theory published in 2002 when network coding was still at its infancy. The last few years have witnessed the rapid development of network coding into a research ?eld of its own in information science. With its root in infor- tion theory, network coding has not only brought about a paradigm shift in network communications at large, but also had signi?cant in?uence on such speci?c research ?elds as coding theory, networking, switching, wireless c- munications,distributeddatastorage,cryptography,andoptimizationtheory. While new applications of network coding keep emerging, the fundamental - sults that lay the foundation of the subject are more or less mature. One of the main goals of this book therefore is to present these results in a unifying and coherent manner. While the previous book focused only on information theory for discrete random variables, the current book contains two new chapters on information theory for continuous random variables, namely the chapter on di?erential entropy and the chapter on continuous-valued channels. With these topics included, the book becomes more comprehensive and is more suitable to be used as a textbook for a course in an electrical engineering department.

Applied Cryptography and Network Security

Applied Cryptography and Network Security PDF Author: Bart Preneel
Publisher: Springer
ISBN: 3319933876
Category : Computers
Languages : en
Pages : 715

Get Book Here

Book Description
This book constitutes the refereed proceedings of the 16th International Conference on on Applied Cryptography and Network Security, ACNS 2018, held in Leuven, Belgium, in July 2018. The 36 revised full papers presented were carefully reviewed and selected from 173 submissions. The papers were organized in topical sections named: Cryptographic Protocols; Side Channel Attacks and Tamper Resistance; Digital Signatures; Privacy Preserving Computation; Multi-party Computation; Symmetric Key Primitives; Symmetric Key Primitives; Symmetric Key Cryptanalysis; Public Key Encryption; Authentication and Biometrics; Cloud and Peer-to-peer Security.

Financial Cryptography and Data Security

Financial Cryptography and Data Security PDF Author: George Danezis
Publisher: Springer Science & Business Media
ISBN: 3642275753
Category : Business & Economics
Languages : en
Pages : 343

Get Book Here

Book Description
This book constitutes the thoroughly refereed post-conference proceedings of the 15th International Conference on Financial Cryptography and Data Security, FC 2011, held in Gros Islet, St. Lucia, in February/March 2011. The 16 revised full papers and 10 revised short papers presented were carefully reviewed and selected from 65 initial submissions. The papers cover all aspects of securing transactions and systems and feature current research focusing on fundamental and applied real-world deployments on all aspects surrounding commerce security; as well as on systems security and inter-disciplinary efforts.

Applied Cryptography and Network Security

Applied Cryptography and Network Security PDF Author: Michael Jacobson
Publisher: Springer
ISBN: 3642389805
Category : Computers
Languages : en
Pages : 584

Get Book Here

Book Description
This book constitutes the refereed proceedings of the 11th International Conference on Applied Cryptography and Network Security, ACNS 2013, held in Banff, Canada, in June 2013. The 33 revised full papers included in this volume were carefully reviewed and selected from 192 submissions. They are organized in topical sections on Cloud Cryptography; Secure Computation; Hash Function and Block Cipher; Signature; System Attack; Secure Implementation - Hardware; Secure Implementation - Software; Group-oriented Systems; Key Exchange and Leakage Resilience; Cryptographic Proof; Cryptosystems.

Topics in Cryptology - CT-RSA 2002

Topics in Cryptology - CT-RSA 2002 PDF Author: Bart Preneel
Publisher: Springer
ISBN: 3540457607
Category : Computers
Languages : en
Pages : 320

Get Book Here

Book Description
This volume continues the tradition established in 2001 of publishing the c- tributions presented at the Cryptographers’ Track (CT-RSA) of the yearly RSA Security Conference in Springer-Verlag’s Lecture Notes in Computer Science series. With 14 parallel tracks and many thousands of participants, the RSA - curity Conference is the largest e-security and cryptography conference. In this setting, the Cryptographers’ Track presents the latest scienti?c developments. The program committee considered 49 papers and selected 20 for presen- tion. One paper was withdrawn by the authors. The program also included two invited talks by Ron Rivest (“Micropayments Revisited” – joint work with Silvio Micali) and by Victor Shoup (“The Bumpy Road from Cryptographic Theory to Practice”). Each paper was reviewed by at least three program committee members; paperswrittenbyprogramcommitteemembersreceivedsixreviews.Theauthors of accepted papers made a substantial e?ort to take into account the comments intheversionsubmittedtotheseproceedings.Inalimitednumberofcases,these revisions were checked by members of the program committee. I would like to thank the 20 members of the program committee who helped to maintain the rigorous scienti?c standards to which the Cryptographers’ Track aims to adhere. They wrote thoughtful reviews and contributed to long disc- sions; more than 400 Kbyte of comments were accumulated. Many of them - tended the program committee meeting, while they could have been enjoying the sunny beaches of Santa Barbara.