Pseudorandomness and Cryptographic Applications:
A pseudorandom generator is an easy-to-compute function that stretches a short random string into a much longer string that "looks" just like a random string to any efficient adversary. One immediate application of a pseudorandom generator is the construction of a private key cryptosystem...
Saved in:
| Main Author: | |
|---|---|
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Princeton, NJ
Princeton University Press
[2019]
|
| Series: | Princeton Computer Science Notes
1 |
| Subjects: | |
| Online Access: | DE-1046 DE-859 DE-860 DE-739 DE-1043 DE-858 Volltext |
| Summary: | A pseudorandom generator is an easy-to-compute function that stretches a short random string into a much longer string that "looks" just like a random string to any efficient adversary. One immediate application of a pseudorandom generator is the construction of a private key cryptosystem that is secure against chosen plaintext attack. There do not seem to be natural examples of functions that are pseudorandom generators. On the other hand, there do seem to be a variety of natural examples of another basic primitive: the one-way function. A function is one-way if it is easy to compute but hard for any efficient adversary to invert on average. The first half of the book shows how to construct a pseudorandom generator from any one-way function. Building on this, the second half of the book shows how to construct other useful cryptographic primitives, such as private key cryptosystems, pseudorandom function generators, pseudorandom permutation generators, digital signature schemes, bit commitment protocols, and zero-knowledge interactive proof systems. The book stresses rigorous definitions and proofs |
| Item Description: | Description based on online resource; title from PDF title page (publisher's Web site, viewed 29. Feb 2020) |
| Physical Description: | 1 online resource |
| ISBN: | 9780691206844 |
| DOI: | 10.1515/9780691206844 |
Staff View
MARC
| LEADER | 00000nam a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV046646122 | ||
| 003 | DE-604 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 200331s2019 xx o|||| 00||| eng d | ||
| 020 | |a 9780691206844 |9 978-0-691-20684-4 | ||
| 024 | 7 | |a 10.1515/9780691206844 |2 doi | |
| 035 | |a (ZDB-23-DGG)9780691206844 | ||
| 035 | |a (OCoLC)1148137575 | ||
| 035 | |a (DE-599)BVBBV046646122 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-1046 |a DE-859 |a DE-860 |a DE-739 |a DE-1043 |a DE-858 | ||
| 082 | 0 | |a 005.8/2 |2 22 | |
| 100 | 1 | |a Luby, Michael |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Pseudorandomness and Cryptographic Applications |c Michael Luby |
| 264 | 1 | |a Princeton, NJ |b Princeton University Press |c [2019] | |
| 264 | 4 | |c © 1996 | |
| 300 | |a 1 online resource | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Princeton Computer Science Notes |v 1 | |
| 500 | |a Description based on online resource; title from PDF title page (publisher's Web site, viewed 29. Feb 2020) | ||
| 520 | |a A pseudorandom generator is an easy-to-compute function that stretches a short random string into a much longer string that "looks" just like a random string to any efficient adversary. One immediate application of a pseudorandom generator is the construction of a private key cryptosystem that is secure against chosen plaintext attack. There do not seem to be natural examples of functions that are pseudorandom generators. On the other hand, there do seem to be a variety of natural examples of another basic primitive: the one-way function. A function is one-way if it is easy to compute but hard for any efficient adversary to invert on average. The first half of the book shows how to construct a pseudorandom generator from any one-way function. Building on this, the second half of the book shows how to construct other useful cryptographic primitives, such as private key cryptosystems, pseudorandom function generators, pseudorandom permutation generators, digital signature schemes, bit commitment protocols, and zero-knowledge interactive proof systems. The book stresses rigorous definitions and proofs | ||
| 546 | |a In English | ||
| 650 | 7 | |a MATHEMATICS / Applied |2 bisacsh | |
| 650 | 4 | |a Computational complexity | |
| 650 | 4 | |a Data encryption (Computer science) | |
| 650 | 4 | |a Numbers, Random | |
| 650 | 4 | |a Random number generators | |
| 650 | 0 | 7 | |a Kryptologie |0 (DE-588)4033329-2 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Kryptologie |0 (DE-588)4033329-2 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 856 | 4 | 0 | |u https://doi.org/10.1515/9780691206844 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 912 | |a ZDB-23-DGG | ||
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-032057394 | |
| 966 | e | |u https://doi.org/10.1515/9780691206844?locatt=mode:legacy |l DE-1046 |p ZDB-23-DGG |q FAW_PDA_DGG |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1515/9780691206844?locatt=mode:legacy |l DE-859 |p ZDB-23-DGG |q FKE_PDA_DGG |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1515/9780691206844?locatt=mode:legacy |l DE-860 |p ZDB-23-DGG |q FLA_PDA_DGG |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1515/9780691206844?locatt=mode:legacy |l DE-739 |p ZDB-23-DGG |q UPA_PDA_DGG |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1515/9780691206844?locatt=mode:legacy |l DE-1043 |p ZDB-23-DGG |q FAB_PDA_DGG |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1515/9780691206844?locatt=mode:legacy |l DE-858 |p ZDB-23-DGG |q FCO_PDA_DGG |x Verlag |3 Volltext | |
Record in the Search Index
| _version_ | 1824507635748044800 |
|---|---|
| adam_text | |
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Luby, Michael |
| author_facet | Luby, Michael |
| author_role | aut |
| author_sort | Luby, Michael |
| author_variant | m l ml |
| building | Verbundindex |
| bvnumber | BV046646122 |
| collection | ZDB-23-DGG |
| ctrlnum | (ZDB-23-DGG)9780691206844 (OCoLC)1148137575 (DE-599)BVBBV046646122 |
| dewey-full | 005.8/2 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.8/2 |
| dewey-search | 005.8/2 |
| dewey-sort | 15.8 12 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| discipline_str_mv | Informatik |
| doi_str_mv | 10.1515/9780691206844 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000zcb4500</leader><controlfield tag="001">BV046646122</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">200331s2019 xx o|||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780691206844</subfield><subfield code="9">978-0-691-20684-4</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1515/9780691206844</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-23-DGG)9780691206844</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1148137575</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV046646122</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-1046</subfield><subfield code="a">DE-859</subfield><subfield code="a">DE-860</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-1043</subfield><subfield code="a">DE-858</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.8/2</subfield><subfield code="2">22</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Luby, Michael</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Pseudorandomness and Cryptographic Applications</subfield><subfield code="c">Michael Luby</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Princeton, NJ</subfield><subfield code="b">Princeton University Press</subfield><subfield code="c">[2019]</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">© 1996</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Princeton Computer Science Notes</subfield><subfield code="v">1</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Description based on online resource; title from PDF title page (publisher's Web site, viewed 29. Feb 2020)</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">A pseudorandom generator is an easy-to-compute function that stretches a short random string into a much longer string that "looks" just like a random string to any efficient adversary. One immediate application of a pseudorandom generator is the construction of a private key cryptosystem that is secure against chosen plaintext attack. There do not seem to be natural examples of functions that are pseudorandom generators. On the other hand, there do seem to be a variety of natural examples of another basic primitive: the one-way function. A function is one-way if it is easy to compute but hard for any efficient adversary to invert on average. The first half of the book shows how to construct a pseudorandom generator from any one-way function. Building on this, the second half of the book shows how to construct other useful cryptographic primitives, such as private key cryptosystems, pseudorandom function generators, pseudorandom permutation generators, digital signature schemes, bit commitment protocols, and zero-knowledge interactive proof systems. The book stresses rigorous definitions and proofs</subfield></datafield><datafield tag="546" ind1=" " ind2=" "><subfield code="a">In English</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS / Applied</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Data encryption (Computer science)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Numbers, Random</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Random number generators</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Kryptologie</subfield><subfield code="0">(DE-588)4033329-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Kryptologie</subfield><subfield code="0">(DE-588)4033329-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1515/9780691206844</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-23-DGG</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-032057394</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1515/9780691206844?locatt=mode:legacy</subfield><subfield code="l">DE-1046</subfield><subfield code="p">ZDB-23-DGG</subfield><subfield code="q">FAW_PDA_DGG</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1515/9780691206844?locatt=mode:legacy</subfield><subfield code="l">DE-859</subfield><subfield code="p">ZDB-23-DGG</subfield><subfield code="q">FKE_PDA_DGG</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1515/9780691206844?locatt=mode:legacy</subfield><subfield code="l">DE-860</subfield><subfield code="p">ZDB-23-DGG</subfield><subfield code="q">FLA_PDA_DGG</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1515/9780691206844?locatt=mode:legacy</subfield><subfield code="l">DE-739</subfield><subfield code="p">ZDB-23-DGG</subfield><subfield code="q">UPA_PDA_DGG</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1515/9780691206844?locatt=mode:legacy</subfield><subfield code="l">DE-1043</subfield><subfield code="p">ZDB-23-DGG</subfield><subfield code="q">FAB_PDA_DGG</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1515/9780691206844?locatt=mode:legacy</subfield><subfield code="l">DE-858</subfield><subfield code="p">ZDB-23-DGG</subfield><subfield code="q">FCO_PDA_DGG</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV046646122 |
| illustrated | Not Illustrated |
| index_date | 2024-07-03T14:15:29Z |
| indexdate | 2025-02-19T17:27:52Z |
| institution | BVB |
| isbn | 9780691206844 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-032057394 |
| oclc_num | 1148137575 |
| open_access_boolean | |
| owner | DE-1046 DE-859 DE-860 DE-739 DE-1043 DE-858 |
| owner_facet | DE-1046 DE-859 DE-860 DE-739 DE-1043 DE-858 |
| physical | 1 online resource |
| psigel | ZDB-23-DGG ZDB-23-DGG FAW_PDA_DGG ZDB-23-DGG FKE_PDA_DGG ZDB-23-DGG FLA_PDA_DGG ZDB-23-DGG UPA_PDA_DGG ZDB-23-DGG FAB_PDA_DGG ZDB-23-DGG FCO_PDA_DGG |
| publishDate | 2019 |
| publishDateSearch | 2019 |
| publishDateSort | 2019 |
| publisher | Princeton University Press |
| record_format | marc |
| series2 | Princeton Computer Science Notes |
| spelling | Luby, Michael Verfasser aut Pseudorandomness and Cryptographic Applications Michael Luby Princeton, NJ Princeton University Press [2019] © 1996 1 online resource txt rdacontent c rdamedia cr rdacarrier Princeton Computer Science Notes 1 Description based on online resource; title from PDF title page (publisher's Web site, viewed 29. Feb 2020) A pseudorandom generator is an easy-to-compute function that stretches a short random string into a much longer string that "looks" just like a random string to any efficient adversary. One immediate application of a pseudorandom generator is the construction of a private key cryptosystem that is secure against chosen plaintext attack. There do not seem to be natural examples of functions that are pseudorandom generators. On the other hand, there do seem to be a variety of natural examples of another basic primitive: the one-way function. A function is one-way if it is easy to compute but hard for any efficient adversary to invert on average. The first half of the book shows how to construct a pseudorandom generator from any one-way function. Building on this, the second half of the book shows how to construct other useful cryptographic primitives, such as private key cryptosystems, pseudorandom function generators, pseudorandom permutation generators, digital signature schemes, bit commitment protocols, and zero-knowledge interactive proof systems. The book stresses rigorous definitions and proofs In English MATHEMATICS / Applied bisacsh Computational complexity Data encryption (Computer science) Numbers, Random Random number generators Kryptologie (DE-588)4033329-2 gnd rswk-swf Kryptologie (DE-588)4033329-2 s 1\p DE-604 https://doi.org/10.1515/9780691206844 Verlag URL des Erstveröffentlichers Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Luby, Michael Pseudorandomness and Cryptographic Applications MATHEMATICS / Applied bisacsh Computational complexity Data encryption (Computer science) Numbers, Random Random number generators Kryptologie (DE-588)4033329-2 gnd |
| subject_GND | (DE-588)4033329-2 |
| title | Pseudorandomness and Cryptographic Applications |
| title_auth | Pseudorandomness and Cryptographic Applications |
| title_exact_search | Pseudorandomness and Cryptographic Applications |
| title_exact_search_txtP | Pseudorandomness and Cryptographic Applications |
| title_full | Pseudorandomness and Cryptographic Applications Michael Luby |
| title_fullStr | Pseudorandomness and Cryptographic Applications Michael Luby |
| title_full_unstemmed | Pseudorandomness and Cryptographic Applications Michael Luby |
| title_short | Pseudorandomness and Cryptographic Applications |
| title_sort | pseudorandomness and cryptographic applications |
| topic | MATHEMATICS / Applied bisacsh Computational complexity Data encryption (Computer science) Numbers, Random Random number generators Kryptologie (DE-588)4033329-2 gnd |
| topic_facet | MATHEMATICS / Applied Computational complexity Data encryption (Computer science) Numbers, Random Random number generators Kryptologie |
| url | https://doi.org/10.1515/9780691206844 |
| work_keys_str_mv | AT lubymichael pseudorandomnessandcryptographicapplications |