We introduce a new type of Identity-Based Encryption (IBE) scheme that we call Fuzzy Identity-Based Encryption. In Fuzzy IBE we view an identity as set of descriptive attributes. A Fuzzy IBE scheme allows for a private key for an identity, ω, to decrypt a ciphertext encrypted with an identity, ω ′, if and only if the identities ω and ω ′ are close to each other as measured by the “set overlap” distance metric. A Fuzzy IBE scheme can be applied to enable encryption using biometric inputs as identities; the error-tolerance property of a Fuzzy IBE scheme is precisely what allows for the use of biometric identities, which inherently will have some noise each time they are sampled. Additionally, we show that Fuzzy-IBE can be used for a type of application that we term “attribute-based encryption”.

In this paper we present two constructions of Fuzzy IBE schemes. Our constructions can be viewed as an Identity-Based Encryption of a message under several attributes that compose a (fuzzy) identity. Our IBE schemes are both error-tolerant and secure against collusion attacks. Additionally, our basic construction does not use random oracles. We prove the security of our schemes under the Selective-ID security model.

/pdf/fuzzy-identity-based-encryption-21je831ql2.pdf

Fuzzy identity-based encryption

/pdf/fuzzy-identity-based-encryption-1d5v9a6tyj.pdf

Fuzzy Identity Based Encryption.

https://rnajc.ucsf.edu/sites/rnajc.ucsf.edu/files/mRNA_methylation.pdf

Comprehensive Analysis of mRNA Methylation Reveals Enrichment in 3′ UTRs and near Stop Codons

We survey the current techniques to cope with the problem of string matching that allows errors. This is becoming a more and more relevant issue for many fast growing areas such as information retrieval and computational biology. We focus on online searching and mostly on edit distance, explaining the problem and its relevance, its statistical behavior, its history and current developments, and the central ideas of the algorithms and their complexities. We present a number of experiments to compare the performance of the different algorithms and show which are the best choices. We conclude with some directions for future work and open problems.

/pdf/a-guided-tour-to-approximate-string-matching-22fowlmq5b.pdf

A guided tour to approximate string matching

Handwriting has continued to persist as a means of communication and recording information in day-to-day life even with the introduction of new technologies. Given its ubiquity in human transactions, machine recognition of handwriting has practical significance, as in reading handwritten notes in a PDA, in postal addresses on envelopes, in amounts in bank checks, in handwritten fields in forms, etc. This overview describes the nature of handwritten language, how it is transduced into electronic data, and the basic concepts behind written language recognition algorithms. Both the online case (which pertains to the availability of trajectory data during writing) and the off-line case (which pertains to scanned images) are considered. Algorithms for preprocessing, character and word recognition, and performance with practical systems are indicated. Other fields of application, like signature verification, writer authentification, handwriting learning tools are also considered.

/pdf/online-and-off-line-handwriting-recognition-a-comprehensive-4qmt9ty596.pdf

Online and off-line handwriting recognition: a comprehensive survey

In summary there is disclosed a document browser for electronic filing systems, which supports pen-based markup and annotation. The user may electronically write notes (60-64) anywhere on a page (32, 38) and then later search for those notes using the approximate ink matching (AIM) technique. The technique segments (104) the user-drawn strokes, extracts (108) and vector quantizes (112) features contained in those strokes. An edit distance comparison technique (118) is used to query the database (120), rendering the system capable of performing approximate or partial matches to achieve fuzzy search capability.

Document search and retrieval system with partial match searching of user-drawn annotations

The user communicates through a digitizing writing surface with the audio/video control apparatus. An on-screen display is generated, providing the user with a user environment in which a wide range of different tasks and functions can be performed. The digitizing writing surface can be incorporated into a hand-held remote control unit and the audio/video control apparatus may likewise be incorporated into existing home entertainment or computer equipment. By tapping on the writing surface a command bar is presented on the screen, allowing the user to select among various functions. Included in these functions is an on-screen programming feature, allowing the user to select programs for viewing or recording by entry of user-drawn annotations or commands via the writing surface.

Video user's environment

A two-slot addition called Splash, which enables a Sun workstation to outperform a Cray-2 on certain applications, is discussed. Following an overview of the Splash design and programming, hardware development is described. The development of the logic description generator is examined in detail. Splash's runtime environment is described, and an example application, that of sequence comparison, is given. >

Building and using a highly parallel programmable logic array

Tables are a ubiquitous form of communication While everyone seems to know what a table is, a precise, analytical definition of “tabularity” remains elusive because some bureaucratic forms, multicolumn text layouts, and schematic drawings share many characteristics of tables There are significant differences between typeset tables, electronic files designed for display of tables, and tables in symbolic form intended for information retrieval Most past research has addressed the extraction of low-level geometric information from raster images of tables scanned from printed documents, although there is growing interest in the processing of tables in electronic form as well Recent research on table composition and table analysis has improved our understanding of the distinction between the logical and physical structures of tables, and has led to improved formalisms for modeling tables This review, which is structured in terms of generalized paradigms for table processing, indicates that progress on half-a-dozen specific research issues would open the door to using existing paper and electronic tables for database update, tabular browsing, structured information retrieval through graphical and audio interfaces, multimedia table editing, and platform-independent display

Table-processing paradigms : a research survey

The bitmap image data is analyzed by connected component extraction to identify components or connected components that represent either individual characters or letters, or regions of a nontext image The connected components are classified as text or nontext based on geometric attributes such as the number of holes, arcs and line ends comprising each component A nearest-neighbor analysis then identifies which text components represent lines or strings of text and each line or string is further analyzed to determine its vertical or horizontal orientation Thereafter, separate vertical and horizontal font height filters are used to identify those text strings that are the most likely candidates For the most likely title candidates a bounding box is defined which can be associated with or overlaid upon the original bitmap data to select the title region for further processing or display Captions and photographs can also be located

Daniel P. Lopresti

Papers

Document search and retrieval system with partial match searching of user-drawn annotations

Video user's environment

Building and using a highly parallel programmable logic array

Table-processing paradigms : a research survey

Caption and photo extraction from scanned document images