1300 187 187
Time-series data - data arriving in time order, or a data stream - can be found in fields such as physics, finance, music, networking, and medical instrumentation. Designing fast, scalable algorithms for analyzing single or multiple time series can yield scientific discoveries, medical diagnoses, and certainly profits. High Performance Discovery in Time Series presents rapid-discovery techniques for finding portions of time series with many events (i.e., gamma-ray scatterings) and finding closely related time series (i.e., highly correlated price histories, or musical melodies). Such real-time streaming data analysis is critical for complex real-world data in telecommunications, bioinformatics, and finance databases. This new monograph provides a technical survey of concepts and techniques for describing and analyzing large-scale time-series data streams. It offers essential coverage of the topic for database and online web services researchers and professionals, as well as an ideal resource for graduates.
| Factoring Large Numbers with the TWIRL Device | p. 1 |
| New Partial Key Exposure Attacks on RSA | p. 27 |
| Algebraic Cryptanalysis of Hidden Field Equation (HFE) Cryptosystems Using Grobner Bases | p. 44 |
| On Constructing Locally Computable Extractors and Cryptosystems in the Bounded Storage Model | p. 61 |
| Unconditional Authenticity and Privacy from an Arbitrarily Weak Secret | p. 78 |
| On Cryptographic Assumptions and Challenges | p. 96 |
| Scalable Protocols for Authenticated Group Key Exchange | p. 110 |
| Practical Verifiable Encryption and Decryption of Discrete Logarithms | p. 126 |
| Extending Oblivious Transfers Efficiently | p. 145 |
| Algebraic Attacks on Combiners with Memory | p. 162 |
| Fast Algebraic Attacks on Stream Ciphers with Linear Feedback | p. 176 |
| Cryptanalysis of Safer++ | p. 195 |
| A Polynomial Time Algorithm for the Braid Diffie-Hellman Conjugacy Problem | p. 212 |
| The Impact of Decryption Failures on the Security of NTRU Encryption | p. 226 |
| Universally Composable Efficient Multiparty Computation from Threshold Homomorphic Encryption | p. 247 |
| Universal Composition with Joint State | p. 265 |
| Statistical Zero-Knowledge Proofs with Efficient Provers: Lattice Problems and More | p. 282 |
| Derandomization in Cryptography | p. 299 |
| On Deniability in the Common Reference String and Random Oracle Model | p. 316 |
| Primality Proving via one Round in ECPP and One Iteration in AKS | p. 338 |
| Torus-Based Cryptography | p. 349 |
| Efficient Universal Padding Technique for Multiplicative Trapdoor One-Way Permutation | p. 366 |
| Multipurpose Identity-Based Signcryption (A Swiss Army Knife for Identity-Based Cryptography) | p. 383 |
| SIGMA: The 'SIGn-and-MAc' Approach to Authenticated Diffie-Hellman and Its Use in the IKE Protocols | p. 400 |
| On Memory-Bound Functions for Fighting Spam | p. 426 |
| Lower and Upper Bounds on Obtaining History Independence | p. 445 |
| Private Circuits: Securing Hardware against Probing Attacks | p. 463 |
| A Tweakable Enciphering Mode | p. 482 |
| A Message Authentication Code Based on Unimodular Matrix Groups | p. 500 |
| Luby-Rackoff: 7 Rounds Are Enough for 2[superscript n(1-[epsilon])] Security | p. 513 |
| Weak Key Authenticity and the Computational Completeness of Formal Encryption | p. 530 |
| Plaintext Awareness via Key Registration | p. 548 |
| Relaxing Chosen-Ciphertext Security | p. 565 |
| Password Interception in a SSL/TLS Channel | p. 583 |
| Instant Ciphertext-Only Cryptanalysis of GSM Encrypted Communication | p. 600 |
| Making a Faster Cryptanalytic Time-Memory Trade-Off | p. 617 |
| Author Index | p. 631 |
| Table of Contents provided by Blackwell. All Rights Reserved. |
ISBN: 9783540406747
ISBN-10: 3540406743
Series: Lecture Notes in Computer Science
Audience:
Professional
Format:
Paperback
Language:
English
Number Of Pages: 648
Dimensions (cm): 23.4 x 15.6
x 3.3
Weight (kg): 0.962
9am - 4pm AEST, Monday - Friday
