Search Results for advances-in-cryptology-crypto-91

Secret sharing homomorphisms: Keeping shares of a secret secret, In A. Odlyzko, editor, Advances in Cryptology, Proc. of Crypto '86 (Lecture Notes in Computer Science 263), pages 251–260. Springer-Verlag, 1987. Santa Barbara, California ...

Author: Joan Feigenbaum

Publisher: Springer

ISBN: 9783540467663

Category: Computers

Page: 484

View: 271

DOWNLOAD & READ
Crypto '91 was the eleventh in a series of workshops on cryptology sponsoredby the International Association for Cryptologic Research and was held in Santa Barbara, California, in August 1991. This volume contains a full paper or an extended abstract for each of the 39 talks presented at the workshop. All theoretical and practical aspects of cryptology are represented, including: protocol design and analysis, combinatorics and authentication, secret sharing and information theory, cryptanalysis, complexity theory, cryptographic schemas based on number theory, pseudorandomness, applications and implementations, viruses, public-key cryptosystems, and digital signatures.
2003-06-30 By Joan Feigenbaum

References [Bea92] [BM89] [BBCS91] [Boe91] [BC90] [BCR86a] [BCR86b] [CHL94] [Cré87] [CK88] [EGL82] [HL90] [Harg1] [Kil38] [Rab81] D. Beaver. “How to Break a 'Secure Oblivious Transfer Protocol.” Advances in Cryptology - Eurocrypt '92 ...

Author: Don Coppersmith

Publisher: Springer

ISBN: 9783540447504

Category: Computers

Page: 466

View: 972

DOWNLOAD & READ
The Crypto ’95 conference was sponsored by the International Association for Cryptologic Research (IACR), in cooperation with the IEEE Computer - ciety Technical Committee on Security and Privacy, and the Computer Science Department of the University of California, Santa Barbara. It took place at the University of California, Santa Barbara, from August 27-31, 1995. This was the fifteenth annual Crypto conference; all have been held at UCSB. For the second time, proceedings were available at the conference. The General Chair, Stafford Tavares, was responsible for local organization and registration. The Program Committee considered 151 papers and selected 36 for pres- tation. There were also two invited talks. Robert Morris, Sr. gave a talk on “Ways of Losing Information,” which included some non-cryptographic means of leaking secrets that are often overlooked by cryptographers. The second talk, “Cryptography - Myths and Realities,” was given by Adi Shamir, this year’s IACR Distinguished Lecturer. Shamir is the second person to receive this honor, the first having been Gus Simmons at Crypto ’94. These proceedings contain revised versions of the 36 contributed talks. Each paper was sent to at least three members of the program committee for c- ments. Revisions were not checked on their scientific aspects. Some authors will write final versions of their papers for publication in refereed journals. Of course, the authors bear full responsibility for the contents of their papers.
2003-05-15 By Don Coppersmith

Kil91. Kil99. KKMO98. KMO94. Kus89. MR92. Nao89. Rab81. Yao82. Yao86. O. Goldreich, S. Micali, and A. Wigderson. ... In Advances in CryptologyCRYPTO '87, volume 293 of Lecture Notes in Computer Science, pages 73–86. Springer, 1988.

Author: Michael Wiener

Publisher: Springer

ISBN: 9783540484059

Category: Computers

Page: 648

View: 577

DOWNLOAD & READ
Crypto ’99, the Nineteenth Annual Crypto Conference, was sponsored by the International Association for Cryptologic Research (IACR), in cooperation with the IEEE Computer Society Technical Committee on Security and Privacy and the Computer Science Department, University of California, Santa Barbara (UCSB). The General Chair, Donald Beaver, was responsible for local organization and registration. The Program Committee considered 167 papers and selected 38 for presentation. This year’s conference program also included two invited lectures. I was pleased to include in the program UeliM aurer’s presentation “Information Theoretic Cryptography” and Martin Hellman’s presentation “The Evolution of Public Key Cryptography.” The program also incorporated the traditional Rump Session for informal short presentations of new results, run by Stuart Haber. These proceedings include the revised versions of the 38 papers accepted by the Program Committee. These papers were selected from all the submissions to the conference based on originality, quality, and relevance to the field of cryptology. Revisions were not checked, and the authors bear full responsibility for the contents of their papers.
2003-07-31 By Michael Wiener

[3] E. Biham, A. Shamir "Differential Cryptanalysis of Feal and N-Hash", Advances in Cryptology - EUROCRYPT'91, p1-16 (1991). [4] H. Gilbert, G. Chasse : "A STATISTICAL ATTACK OF THE FEAL-8 CRYPTOSYSTEM", Advances in Cryptology ...

Author: Yvo G. Desmedt

Publisher: Springer

ISBN: 9783540486589

Category: Computers

Page: 438

View: 931

DOWNLOAD & READ
The CRYPTO ’94 conference is sponsored by the International Association for Cryptologic Research (IACR), in co-operation with the IEEE Computer Society Technical Committee on Security and Privacy. It has taken place at the Univ- sity of California, Santa Barbara, from August 21-25,1994. This is the fourteenth annual CRYPTO conference, all of which have been held at UCSB. This is the first time that proceedings are available at the conference. The General Chair, Jimmy R. Upton has been responsible for local organization, registration, etc. There were 114 submitted papers which were considered by the Program Committee. Of these, 1 was withdrawn and 38 were selected for the proce- ings. There are also 3 invited talks. Two of these are on aspects of cryptog- phy in the commercial world. The one on hardware aspects will be presented by David Maher (AT&T), the one on software aspects by Joseph Pato (Hewlett- Packard). There will also be a panel discussion on “Securing an Electronic World: Are We Ready?” The panel members will be: Ross Anderson, Bob Blakley, Matt Blaze, George Davida, Yvo Desmedt (moderator), Whitfield Diffie, Joan Feig- baum, Blake Greenlee, Martin Hellman, David Maher, Miles Smid. The topic of the panel will be introduced by the invited talk of Whitfield Diffie on ”Securing the Information Highway. ” These proceedings contain revised versions of the 38 contributed talks. Each i paper was sent to at least 3 members of the program committee for comments.
2003-05-15 By Yvo G. Desmedt

13th Annual International Cryptology Conference Santa Barbara, California, USA August 22–26, 1993 Proceedings Douglas R. Stinson ... 4, Number 1, 1991 (The extended abstract appeared at CRYPTO'90) [BS91-1] E. Biham and A. Shamir, ...

Author: Douglas R. Stinson

Publisher: Springer

ISBN: 9783540483298

Category: Computers

Page: 491

View: 949

DOWNLOAD & READ
The CRYPTO ’93 conference was sponsored by the International Association for Cryptologic Research (IACR) and Bell-Northern Research (a subsidiary of Northern Telecom), in co-operation with the IEEE Computer Society Technical Committee. It took place at the University of California, Santa Barbara, from August 22-26, 1993. This was the thirteenth annual CRYPTO conference, all of which have been held at UCSB. The conference was very enjoyable and ran very of the General Chair, Paul Van Oorschot. smoothly, largely due to the efforts It was a pleasure working with Paul throughout the months leading up to the conference. There were 136 submitted papers which were considered by the Program Committee. Of these, 38 were selected for presentation at the conference. There was also one invited talk at the conference, presented by Miles Smid, the title of which was “A Status Report On the Federal Government Key Escrow System.” The conference also included the customary Rump Session, which was presided over by Whit Diffie in his usual inimitable fashion. Thanks again to Whit for organizing and running the Rump session. This year, the Rump Session included an interesting and lively panel discussion on issues pertaining to key escrowing. Those taking part were W. Diffie, J. Gilmore, S. Goldwasser, M. Hellman, A. Herzberg, S. Micali, R. Rueppel, G. Simmons and D. Weitzner.
2003-05-15 By Douglas R. Stinson

[254] D. CHAUM -, E. VAN HEIJST, AND B. PFITZMANN , “Cryptographically strong undeniable signatures, unconditionally secure for the signer”, Advances in CryptologyCRYPTO '91 (LNCS 576), 470–484, 1992. vances [255] L. CHEN AND T.P. ...

Author: Alfred J. Menezes

Publisher: CRC Press

ISBN: 9780429881329

Category: Mathematics

Page: 810

View: 161

DOWNLOAD & READ
Cryptography, in particular public-key cryptography, has emerged in the last 20 years as an important discipline that is not only the subject of an enormous amount of research, but provides the foundation for information security in many applications. Standards are emerging to meet the demands for cryptographic protection in most areas of data communications. Public-key cryptographic techniques are now in widespread use, especially in the financial services industry, in the public sector, and by individuals for their personal privacy, such as in electronic mail. This Handbook will serve as a valuable reference for the novice as well as for the expert who needs a wider scope of coverage within the area of cryptography. It is a necessary and timely guide for professionals who practice the art of cryptography. The Handbook of Applied Cryptography provides a treatment that is multifunctional: It serves as an introduction to the more practical aspects of both conventional and public-key cryptography It is a valuable source of the latest techniques and algorithms for the serious practitioner It provides an integrated treatment of the field, while still presenting each major topic as a self-contained unit It provides a mathematical treatment to accompany practical discussions It contains enough abstraction to be a valuable reference for theoreticians while containing enough detail to actually allow implementation of the algorithms discussed Now in its third printing, this is the definitive cryptography reference that the novice as well as experienced developers, designers, researchers, engineers, computer scientists, and mathematicians alike will use.
2018-12-07 By Alfred J. Menezes

Advances in Cryptology , CRYPTO 85. Springer - Verlag , LNCS 218 , 1986 . ( C90 ] A.J. Menezes and S.A. Vanstone , editors . Advances in Cryptology , CRYPTO 90 . Springer - Verlag , LNCS 537 , 1991 . ( C91 ] J. Feigenbaum , editor .

Author: I. Blake

Publisher: Cambridge University Press

ISBN: 0521653746

Category: Computers

Page: 204

View: 369

DOWNLOAD & READ
This book explains the mathematics behind practical implementations of elliptic curve systems.
1999-07-08 By I. Blake

S91. Sch99. SGD97. R. Cramer, R. Gennaro, and B. Schoenmakers. “A secure and optimally efficient multi-authority election scheme”. LNCS 1233, Advances in CryptologyEUROCRYPT'97, pp. 103–118, 1997. L. F. Cranor and R. K. Cytron.

Author: Paul F. Syverson

Publisher: Springer

ISBN: 9783540460886

Category: Computers

Page: 379

View: 279

DOWNLOAD & READ
This book constitutes the thoroughly refereed post-proceedings of the 5th International Conference on Financial Cryptography, FC 2001, held in Grand Cayman, British West Indies, in February 2001. The 20 revised full papers presented together with various panel statements and one invited paper were carefully selected during two rounds of reviewing and improvement. The papers are organized in topical sections on managing payment transaction costs, trust and risk management, groups and anonymity, certificates and authentication, credit card security, markets and multiparty computation, digital signatures and financial cryptography, and auctions.
2003-08-01 By Paul F. Syverson

This generator is an example of a Trapdoor Generator [13], and its trapdoor properties have been used in protocol design. We strengthen the security of this gene- tor by proving it as hard as factoring.

Author: G.R. Blakely

Publisher: Springer

ISBN: 3540395687

Category: Computers

Page: 496

View: 132

DOWNLOAD & READ
Recently, there has been a lot of interest in provably "good" pseudo-random number generators [lo, 4, 14, 31. These cryptographically secure generators are "good" in the sense that they pass all probabilistic polynomial time statistical tests. However, despite these nice properties, the secure generators known so far suffer from the han- cap of being inefiicient; the most efiicient of these take n2 steps (one modular multip- cation, n being the length of the seed) to generate one bit. Pseudc-random number g- erators that are currently used in practice output n bits per multiplication (n2 steps). An important open problem was to output even two bits on each multiplication in a cryptographically secure way. This problem was stated by Blum, Blum & Shub [3] in the context of their z2 mod N generator. They further ask: how many bits can be o- put per multiplication, maintaining cryptographic security? In this paper we state a simple condition, the XOR-Condition and show that any generator satisfying this condition can output logn bits on each multiplication. We show that the XOR-Condition is satisfied by the lop least significant bits of the z2-mod N generator. The security of the z2 mod N generator was based on Quadratic Residu- ity [3]. This generator is an example of a Trapdoor Generator [13], and its trapdoor properties have been used in protocol design. We strengthen the security of this gene- tor by proving it as hard as factoring.
2003-05-16 By G.R. Blakely

E. Biham, “Cryptanalysis of the Chaotic-Map Cryptosystem Suggested at EUROCRYPT '91,” Advances in CryptologyEUROCRYPT '91 Proceedings, Springer-Verlag, 1991, pp. 532–534. 158. E. Biham, “New Types of Cryptanalytic Attacks Using Related ...

Author: Bruce Schneier

Publisher: John Wiley & Sons

ISBN: 9781119439028

Category: Computers

Page: 784

View: 100

DOWNLOAD & READ
From the world's most renowned security technologist, Bruce Schneier, this 20th Anniversary Edition is the most definitive reference on cryptography ever published and is the seminal work on cryptography. Cryptographic techniques have applications far beyond the obvious uses of encoding and decoding information. For developers who need to know about capabilities, such as digital signatures, that depend on cryptographic techniques, there's no better overview than Applied Cryptography, the definitive book on the subject. Bruce Schneier covers general classes of cryptographic protocols and then specific techniques, detailing the inner workings of real-world cryptographic algorithms including the Data Encryption Standard and RSA public-key cryptosystems. The book includes source-code listings and extensive advice on the practical aspects of cryptography implementation, such as the importance of generating truly random numbers and of keeping keys secure. ". . .the best introduction to cryptography I've ever seen. . . .The book the National Security Agency wanted never to be published. . . ." -Wired Magazine ". . .monumental . . . fascinating . . . comprehensive . . . the definitive work on cryptography for computer programmers . . ." -Dr. Dobb's Journal ". . .easily ranks as one of the most authoritative in its field." -PC Magazine The book details how programmers and electronic communications professionals can use cryptography-the technique of enciphering and deciphering messages-to maintain the privacy of computer data. It describes dozens of cryptography algorithms, gives practical advice on how to implement them into cryptographic software, and shows how they can be used to solve security problems. The book shows programmers who design computer applications, networks, and storage systems how they can build security into their software and systems. With a new Introduction by the author, this premium edition will be a keepsake for all those committed to computer and cyber security.
2017-05-25 By Bruce Schneier