Conditionally-perfect secrecy and a provably-secure randomized cipher
Shannon's pessimistic theorem, which states that a cipher can be perfect only when the entropy of the secret key is at least as great as that of the plaintext, is relativized by the demonstration of a randomized cipher in which the secret key is short but the plaintext can be very long. Two mod...
Gespeichert in:
| Veröffentlicht in: | Journal of cryptology 1992, Vol.5 (1), p.53-66 |
|---|---|
| 1. Verfasser: | |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 66 |
|---|---|
| container_issue | 1 |
| container_start_page | 53 |
| container_title | Journal of cryptology |
| container_volume | 5 |
| creator | MAURER, U. M |
| description | Shannon's pessimistic theorem, which states that a cipher can be perfect only when the entropy of the secret key is at least as great as that of the plaintext, is relativized by the demonstration of a randomized cipher in which the secret key is short but the plaintext can be very long. Two modifications of this cipher are discussed that may lead to practical provably-secure ciphers based on either of two assumptions that appear to be novel in cryptography, viz., the (sole) assumption that the enemy's memory capacity (but not his computing power) is restricted and the assumption that an explicit function is, in a specified sense, controllably-difficult to compute, but not necessarily one-way. |
| doi_str_mv | 10.1007/bf00191321 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_25575409</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>25575409</sourcerecordid><originalsourceid>FETCH-LOGICAL-c3061-20e5118d185a6cc99fbb0ddd424ba83ef6ab5e3c638e077841125d21f9f43ea23</originalsourceid><addsrcrecordid>eNo9kE9LxDAQxYMouFYvfoIexINQzeRP0x512VVhwYueS5pMMNJta7IV6qc3squngTdvHvN-hFwCvQVK1V3rKIUaOIMjsgDBWQFcVcdkQWvOC6ZqekrOYvxILiUVX5DVcuit3_mh1103FyMGh2aXRzQBzZzr3uY6H8Pwpdu0TvIUMA9JHrb-G21u_PiO4ZycON1FvDjMjLytV6_Lp2Lz8vi8vN8UhtMSCkZRAlQWKqlLY-ratS211gomWl1xdKVuJXJT8gqpUpUAYNIycLUTHDXjGbne56aPPieMu2bro8Gu0z0OU2yYlEqK1DUjN3ujCUOMAV0zBr_VYW6ANr-kmof1H6lkvjqk6mh051I94-P_hRAJpJT8B7wVZ8M</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>25575409</pqid></control><display><type>article</type><title>Conditionally-perfect secrecy and a provably-secure randomized cipher</title><source>SpringerLink Journals - AutoHoldings</source><creator>MAURER, U. M</creator><creatorcontrib>MAURER, U. M</creatorcontrib><description>Shannon's pessimistic theorem, which states that a cipher can be perfect only when the entropy of the secret key is at least as great as that of the plaintext, is relativized by the demonstration of a randomized cipher in which the secret key is short but the plaintext can be very long. Two modifications of this cipher are discussed that may lead to practical provably-secure ciphers based on either of two assumptions that appear to be novel in cryptography, viz., the (sole) assumption that the enemy's memory capacity (but not his computing power) is restricted and the assumption that an explicit function is, in a specified sense, controllably-difficult to compute, but not necessarily one-way.</description><identifier>ISSN: 0933-2790</identifier><identifier>EISSN: 1432-1378</identifier><identifier>DOI: 10.1007/bf00191321</identifier><language>eng</language><publisher>New York, NY: Springer</publisher><subject>Applied sciences ; Cryptography ; Exact sciences and technology ; Information, signal and communications theory ; Signal and communications theory ; Telecommunications and information theory</subject><ispartof>Journal of cryptology, 1992, Vol.5 (1), p.53-66</ispartof><rights>1993 INIST-CNRS</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c3061-20e5118d185a6cc99fbb0ddd424ba83ef6ab5e3c638e077841125d21f9f43ea23</citedby><cites>FETCH-LOGICAL-c3061-20e5118d185a6cc99fbb0ddd424ba83ef6ab5e3c638e077841125d21f9f43ea23</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>309,310,314,776,780,785,786,4035,4036,23910,23911,25119,27903,27904</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=4414355$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>MAURER, U. M</creatorcontrib><title>Conditionally-perfect secrecy and a provably-secure randomized cipher</title><title>Journal of cryptology</title><description>Shannon's pessimistic theorem, which states that a cipher can be perfect only when the entropy of the secret key is at least as great as that of the plaintext, is relativized by the demonstration of a randomized cipher in which the secret key is short but the plaintext can be very long. Two modifications of this cipher are discussed that may lead to practical provably-secure ciphers based on either of two assumptions that appear to be novel in cryptography, viz., the (sole) assumption that the enemy's memory capacity (but not his computing power) is restricted and the assumption that an explicit function is, in a specified sense, controllably-difficult to compute, but not necessarily one-way.</description><subject>Applied sciences</subject><subject>Cryptography</subject><subject>Exact sciences and technology</subject><subject>Information, signal and communications theory</subject><subject>Signal and communications theory</subject><subject>Telecommunications and information theory</subject><issn>0933-2790</issn><issn>1432-1378</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1992</creationdate><recordtype>article</recordtype><recordid>eNo9kE9LxDAQxYMouFYvfoIexINQzeRP0x512VVhwYueS5pMMNJta7IV6qc3squngTdvHvN-hFwCvQVK1V3rKIUaOIMjsgDBWQFcVcdkQWvOC6ZqekrOYvxILiUVX5DVcuit3_mh1103FyMGh2aXRzQBzZzr3uY6H8Pwpdu0TvIUMA9JHrb-G21u_PiO4ZycON1FvDjMjLytV6_Lp2Lz8vi8vN8UhtMSCkZRAlQWKqlLY-ratS211gomWl1xdKVuJXJT8gqpUpUAYNIycLUTHDXjGbne56aPPieMu2bro8Gu0z0OU2yYlEqK1DUjN3ujCUOMAV0zBr_VYW6ANr-kmof1H6lkvjqk6mh051I94-P_hRAJpJT8B7wVZ8M</recordid><startdate>1992</startdate><enddate>1992</enddate><creator>MAURER, U. M</creator><general>Springer</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>1992</creationdate><title>Conditionally-perfect secrecy and a provably-secure randomized cipher</title><author>MAURER, U. M</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c3061-20e5118d185a6cc99fbb0ddd424ba83ef6ab5e3c638e077841125d21f9f43ea23</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1992</creationdate><topic>Applied sciences</topic><topic>Cryptography</topic><topic>Exact sciences and technology</topic><topic>Information, signal and communications theory</topic><topic>Signal and communications theory</topic><topic>Telecommunications and information theory</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>MAURER, U. M</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Journal of cryptology</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>MAURER, U. M</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Conditionally-perfect secrecy and a provably-secure randomized cipher</atitle><jtitle>Journal of cryptology</jtitle><date>1992</date><risdate>1992</risdate><volume>5</volume><issue>1</issue><spage>53</spage><epage>66</epage><pages>53-66</pages><issn>0933-2790</issn><eissn>1432-1378</eissn><abstract>Shannon's pessimistic theorem, which states that a cipher can be perfect only when the entropy of the secret key is at least as great as that of the plaintext, is relativized by the demonstration of a randomized cipher in which the secret key is short but the plaintext can be very long. Two modifications of this cipher are discussed that may lead to practical provably-secure ciphers based on either of two assumptions that appear to be novel in cryptography, viz., the (sole) assumption that the enemy's memory capacity (but not his computing power) is restricted and the assumption that an explicit function is, in a specified sense, controllably-difficult to compute, but not necessarily one-way.</abstract><cop>New York, NY</cop><pub>Springer</pub><doi>10.1007/bf00191321</doi><tpages>14</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0933-2790 |
| ispartof | Journal of cryptology, 1992, Vol.5 (1), p.53-66 |
| issn | 0933-2790 1432-1378 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_25575409 |
| source | SpringerLink Journals - AutoHoldings |
| subjects | Applied sciences Cryptography Exact sciences and technology Information, signal and communications theory Signal and communications theory Telecommunications and information theory |
| title | Conditionally-perfect secrecy and a provably-secure randomized cipher |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-26T05%3A43%3A54IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Conditionally-perfect%20secrecy%20and%20a%20provably-secure%20randomized%20cipher&rft.jtitle=Journal%20of%20cryptology&rft.au=MAURER,%20U.%20M&rft.date=1992&rft.volume=5&rft.issue=1&rft.spage=53&rft.epage=66&rft.pages=53-66&rft.issn=0933-2790&rft.eissn=1432-1378&rft_id=info:doi/10.1007/bf00191321&rft_dat=%3Cproquest_cross%3E25575409%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=25575409&rft_id=info:pmid/&rfr_iscdi=true |