My Account Log in

1 option

Advances in Cryptology - CRYPTO '99 : 19th Annual International Cryptology Conference, Santa Barbara, California, USA, August 15-19, 1999 Proceedings / edited by Michael Wiener.

LIBRA Q341 .P7 2004
Loading location information...

Available from offsite location This item is stored in our repository but can be checked out.

Log in to request item
Format:
Book
Contributor:
Wiener, Michael, 1963- editor.
SpringerLink (Online service)
Series:
Computer Science (Springer-11645)
Lecture notes in computer science 0302-9743 ; 1666.
Lecture Notes in Computer Science, 0302-9743 ; 1666
Language:
English
Subjects (All):
Computer security.
Coding theory.
Information theory.
Data encryption (Computer science).
Algorithms.
Management information systems.
Computer science.
Computer networks.
Systems and Data Security.
Coding and Information Theory.
Cryptology.
Algorithm Analysis and Problem Complexity.
Management of Computing and Information Systems.
Computer Communication Networks.
Local Subjects:
Systems and Data Security.
Coding and Information Theory.
Cryptology.
Algorithm Analysis and Problem Complexity.
Management of Computing and Information Systems.
Computer Communication Networks.
Physical Description:
1 online resource (XII, 648 pages).
Edition:
First edition 1999.
Contained In:
Springer eBooks
Place of Publication:
Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1999.
System Details:
text file PDF
Summary:
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.
Contents:
Public-Key Cryptanalysis I
On the Security of RSA Padding
Cryptanalysis of the HFE Public Key Cryptosystem by Relinearization
The Hardness of the Hidden Subset Sum Problem and Its Cryptographic Implications
Invited Lecture
Information-Theoretic Cryptography
Secure Communication and Computation
Information Theoretically Secure Communication in the Limited Storage Space Model
The All-or-Nothing Nature of Two-Party Secure Computation
Distributed Cryptography
Adaptive Security for Threshold Cryptosystems
Two Party RSA Key Generation
Robust Distributed Multiplication without Interaction
A Simple Publicly Verifiable Secret Sharing Scheme and Its Application to Electronic Voting
Secret-Key Cryptography
Truncated Differentials and Skipjack
Fast Correlation Attacks Based on Turbo Code Techniques
Highly Nonlinear Resilient Functions Optimizing Siegenthaler's Inequality
Message Authentication Codes
UMAC: Fast and Secure Message Authentication
Square Hash: Fast Message Authentication via Optimized Universal Hash Functions
Constructing VIL-MACs from FIL-MACs: Message Authentication under Weakened Assumptions
Stateless Evaluation of Pseudorandom Functions: Security Beyond the Birthday Barrier
Public-Key Cryptanalysis II
Cryptanalysis of the Goldreich-Goldwasser-Halevi Cryptosystem from Crypto '97
Weakness in Quaternion Signatures
Cryptanalysis of "2R" Schemes
Factoring N = p r q for Large r
Traitor Tracing
An Efficient Public Key Traitor Tracing Scheme
Dynamic Traitor Tracing
Efficient Methods for Integrating Traceability and Broadcast Encryption
Differential Power Analysis
Towards Sound Approaches to Counteract Power-Analysis Attacks
Signature Schemes
Separability and Efficiency for Generic Group Signature Schemes
A Forward-Secure Digital Signature Scheme
Abuse-Free Optimistic Contract Signing
Zero Knowledge
Can Statistical Zero Knowledge Be Made Non-interactive? or On the Relationship of SZK and NISZK
On Concurrent Zero-Knowledge with Pre-processing
Asymmetric Encryption
On the Security Properties of OAEP as an All-or-Nothing Transform
Non-malleable Encryption: Equivalence between Two Notions, and an Indistinguishability-Based Characterization
Secure Integration of Asymmetric and Symmetric Encryption Schemes
Electronic Cash
Auditable, Anonymous Electronic Cash
Protocols and Broadcasting
Oblivious Transfer with Adaptive Queries
Compressing Cryptographic Resources
Coding Constructions for Blacklisting Problems without Computational Assumptions
An Information Theoretic Analysis of Rooted-Tree Based Secure Multicast Key Distribution Schemes.
Other Format:
Printed edition:
ISBN:
978-3-540-48405-9
9783540484059
Access Restriction:
Restricted for use by site license.

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

Find

Home Release notes

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Find catalog Using Articles+ Using your account