The Resource Cryptography in Constant Parallel Time, Benny Applebaum
Cryptography in Constant Parallel Time, Benny Applebaum
Resource Information
The item Cryptography in Constant Parallel Time, Benny Applebaum represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.This item is available to borrow from 2 library branches.
Resource Information
The item Cryptography in Constant Parallel Time, Benny Applebaum represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.
This item is available to borrow from 2 library branches.
 Summary
 Locally computable (NC0) functions are "simple" functions for which every bit of the output can be computed by reading a small number of bits of their input. The study of locally computable cryptography attempts to construct cryptographic functions that achieve this strong notion of simplicity and simultaneously provide a high level of security. Such constructions are highly parallelizable and they can be realized by Boolean circuits of constant depth. This book establishes, for the first time, the possibility of local implementations for many basic cryptographic primitives such as oneway functions, pseudorandom generators, encryption schemes and digital signatures. It also extends these results to other stronger notions of locality, and addresses a wide variety of fundamental questions about local cryptography. The author's related thesis was honorably mentioned (runnerup) for the ACM Dissertation Award in 2007, and this book includes some expanded sections and proofs, and notes on recent developments. The book assumes only a minimal background in computational complexity and cryptography and is therefore suitable for graduate students or researchers in related areas who are interested in parallel cryptography. It also introduces general techniques and tools which are likely to interest experts in the area
 Language
 eng
 Extent
 1 online resource (xvi, 193 pages)
 Contents

 Introduction
 Preliminaries and Definitions
 Randomized Encoding of Functions
 Cryptography in NC0
 Computationally Private Randomizing Polynomials and Their Applications
 On Pseudorandom Generators with Linear Stretch in NC0
 Cryptography with Constant Input Locality
 OneWay Functions with Optimal Output Locality
 App. A, On Collections of Cryptographic Primitives
 Isbn
 9783642173660
 Label
 Cryptography in Constant Parallel Time
 Title
 Cryptography in Constant Parallel Time
 Statement of responsibility
 Benny Applebaum
 Subject

 COMPUTERS  Data Processing
 COMPUTERS  Hardware  General
 COMPUTERS  Information Technology
 COMPUTERS  Machine Theory
 COMPUTERS  Reference
 Computer science
 Computer science
 Computer science
 Data Structures, Cryptology and Information Theory
 Data encryption (Computer science)
 Data encryption (Computer science)
 Data encryption (Computer science)
 Data structures (Computer science)
 Data structures (Computer science)
 Data structures (Computer science)
 Mathematics of Computing
 COMPUTERS  Computer Literacy
 COMPUTERS  Computer Science
 Language
 eng
 Summary
 Locally computable (NC0) functions are "simple" functions for which every bit of the output can be computed by reading a small number of bits of their input. The study of locally computable cryptography attempts to construct cryptographic functions that achieve this strong notion of simplicity and simultaneously provide a high level of security. Such constructions are highly parallelizable and they can be realized by Boolean circuits of constant depth. This book establishes, for the first time, the possibility of local implementations for many basic cryptographic primitives such as oneway functions, pseudorandom generators, encryption schemes and digital signatures. It also extends these results to other stronger notions of locality, and addresses a wide variety of fundamental questions about local cryptography. The author's related thesis was honorably mentioned (runnerup) for the ACM Dissertation Award in 2007, and this book includes some expanded sections and proofs, and notes on recent developments. The book assumes only a minimal background in computational complexity and cryptography and is therefore suitable for graduate students or researchers in related areas who are interested in parallel cryptography. It also introduces general techniques and tools which are likely to interest experts in the area
 Cataloging source
 DKDLA
 http://library.link/vocab/creatorName
 Applebaum, Benny
 Dewey number
 004.0151
 Illustrations
 illustrations
 Index
 no index present
 Language note
 English
 LC call number
 QA76.9.M35
 Literary form
 non fiction
 Nature of contents

 dictionaries
 bibliography
 Series statement
 Information security and cryptography,
 http://library.link/vocab/subjectName

 Data encryption (Computer science)
 Computer science
 Data structures (Computer science)
 Mathematics of Computing
 Data Structures, Cryptology and Information Theory
 COMPUTERS
 COMPUTERS
 COMPUTERS
 COMPUTERS
 COMPUTERS
 COMPUTERS
 COMPUTERS
 Computer science
 Data encryption (Computer science)
 Data structures (Computer science)
 Label
 Cryptography in Constant Parallel Time, Benny Applebaum
 Bibliography note
 Includes bibliographical references (pages 187193)
 Carrier category
 online resource
 Carrier category code

 cr
 Carrier MARC source
 rdacarrier
 Content category
 text
 Content type code

 txt
 Content type MARC source
 rdacontent
 Contents
 Introduction  Preliminaries and Definitions  Randomized Encoding of Functions  Cryptography in NC0  Computationally Private Randomizing Polynomials and Their Applications  On Pseudorandom Generators with Linear Stretch in NC0  Cryptography with Constant Input Locality  OneWay Functions with Optimal Output Locality  App. A, On Collections of Cryptographic Primitives
 Control code
 869793138
 Extent
 1 online resource (xvi, 193 pages)
 Form of item
 online
 Isbn
 9783642173660
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code

 c
 Other control number
 10.1007/9783642173677
 Other physical details
 illustrations.
 Specific material designation
 remote
 System control number
 (OCoLC)869793138
 Label
 Cryptography in Constant Parallel Time, Benny Applebaum
 Bibliography note
 Includes bibliographical references (pages 187193)
 Carrier category
 online resource
 Carrier category code

 cr
 Carrier MARC source
 rdacarrier
 Content category
 text
 Content type code

 txt
 Content type MARC source
 rdacontent
 Contents
 Introduction  Preliminaries and Definitions  Randomized Encoding of Functions  Cryptography in NC0  Computationally Private Randomizing Polynomials and Their Applications  On Pseudorandom Generators with Linear Stretch in NC0  Cryptography with Constant Input Locality  OneWay Functions with Optimal Output Locality  App. A, On Collections of Cryptographic Primitives
 Control code
 869793138
 Extent
 1 online resource (xvi, 193 pages)
 Form of item
 online
 Isbn
 9783642173660
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code

 c
 Other control number
 10.1007/9783642173677
 Other physical details
 illustrations.
 Specific material designation
 remote
 System control number
 (OCoLC)869793138
Subject
 COMPUTERS  Data Processing
 COMPUTERS  Hardware  General
 COMPUTERS  Information Technology
 COMPUTERS  Machine Theory
 COMPUTERS  Reference
 Computer science
 Computer science
 Computer science
 Data Structures, Cryptology and Information Theory
 Data encryption (Computer science)
 Data encryption (Computer science)
 Data encryption (Computer science)
 Data structures (Computer science)
 Data structures (Computer science)
 Data structures (Computer science)
 Mathematics of Computing
 COMPUTERS  Computer Literacy
 COMPUTERS  Computer Science
Member of
Library Links
Embed
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.library.missouri.edu/portal/CryptographyinConstantParallelTimeBenny/LgHMbtMGGE8/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/CryptographyinConstantParallelTimeBenny/LgHMbtMGGE8/">Cryptography in Constant Parallel Time, Benny Applebaum</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data  Experimental
Data Citation of the Item Cryptography in Constant Parallel Time, Benny Applebaum
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.library.missouri.edu/portal/CryptographyinConstantParallelTimeBenny/LgHMbtMGGE8/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/CryptographyinConstantParallelTimeBenny/LgHMbtMGGE8/">Cryptography in Constant Parallel Time, Benny Applebaum</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>