<?xml version="1.0" encoding="UTF-8"?>
 <rdf:RDF xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:cc="http://web.resource.org/cc/" xmlns:syn="http://purl.org/rss/1.0/modules/syndication/" xmlns:admin="http://webns.net/mvcb/">
  <channel rdf:about="http://pinboard.in">
    <title>Pinboard (randombit)</title>
    <link>https://pinboard.in/u:randombit/public/</link>
    <description>recent bookmarks from randombit</description>
    <items>
      <rdf:Seq>	<rdf:li rdf:resource="http://www.ccs.neu.edu/home/cbw/static/pdf/larisch-oakland17.pdf"/>
	<rdf:li rdf:resource="http://hillside.net/plop/2004/papers/mhafiz1/PLoP2004_mhafiz1_0.pdf"/>
	<rdf:li rdf:resource="http://eprint.iacr.org/2011/191"/>
	<rdf:li rdf:resource="http://grouper.ieee.org/groups/1363/Research/contributions/hao-ryan-2008.pdf"/>
	<rdf:li rdf:resource="http://lasecwww.epfl.ch/pub/lasec/doc/CHVV03.ps"/>
	<rdf:li rdf:resource="http://ronja.twibright.com/optar/"/>
	<rdf:li rdf:resource="http://eprint.iacr.org/2010/389"/>
	<rdf:li rdf:resource="http://www.cs.berkeley.edu/~daw/papers/pcmodel-long.pdf"/>
	<rdf:li rdf:resource="http://tuprints.ulb.tu-darmstadt.de/2094/1/thesis.lehmann.pdf"/>
	<rdf:li rdf:resource="http://dslab.epfl.ch/pubs/crashonly/crashonly.pdf"/>
	<rdf:li rdf:resource="http://eprint.iacr.org/2010/193"/>
	<rdf:li rdf:resource="http://eprint.iacr.org/2010/038"/>
	<rdf:li rdf:resource="http://math.ucr.edu/home/baez/rosetta.pdf"/>
	<rdf:li rdf:resource="http://people.reed.edu/~crandall/papers/parrho.pdf"/>
	<rdf:li rdf:resource="http://eprint.iacr.org/2009/251"/>
	<rdf:li rdf:resource="http://eprint.iacr.org/2009/389"/>
	<rdf:li rdf:resource="http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.59.9389"/>
	<rdf:li rdf:resource="http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.35.1538"/>
	<rdf:li rdf:resource="http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.9013"/>
      </rdf:Seq>
    </items>
  </channel><item rdf:about="http://www.ccs.neu.edu/home/cbw/static/pdf/larisch-oakland17.pdf">
    <title>CRLite: A Scalable System for Pushing All TLS Revocations to All Browsers</title>
    <dc:date>2017-04-03T20:41:20+00:00</dc:date>
    <link>http://www.ccs.neu.edu/home/cbw/static/pdf/larisch-oakland17.pdf</link>
    <dc:creator>randombit</dc:creator><dc:subject>paper security tls</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:randombit/b:1099b2ea78eb/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:paper"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:security"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:tls"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://hillside.net/plop/2004/papers/mhafiz1/PLoP2004_mhafiz1_0.pdf">
    <title>The Security Architecture of qmail</title>
    <dc:date>2013-06-13T00:36:55+00:00</dc:date>
    <link>http://hillside.net/plop/2004/papers/mhafiz1/PLoP2004_mhafiz1_0.pdf</link>
    <dc:creator>randombit</dc:creator><dc:subject>security paper qmail</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:randombit/b:8167612ce80e/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:security"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:paper"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:qmail"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://eprint.iacr.org/2011/191">
    <title>On the Security of the Winternitz One-Time Signature Scheme</title>
    <dc:date>2011-04-27T23:19:12+00:00</dc:date>
    <link>http://eprint.iacr.org/2011/191</link>
    <dc:creator>randombit</dc:creator><description><![CDATA[We show that the Winternitz one-time signature scheme is existentially unforgeable under adaptive chosen message attacks when instantiated with a family of pseudo random functions. Compared to previous results, which require a collision resistant hash function, our result provides significantly smaller signatures at the same security level. We also consider security in the strong sense and show that the Winternitz one-time signature scheme is strongly unforgeable assuming additional properties of the pseudo random function. In this context we formally define several key-based security notions for function families and investigate their relation to pseudorandomness. All our reductions are exact and in the standard model and can directly be used to estimate the output length of the hash function required to meet a certain security level. ]]></description>
<dc:subject>winternitz hash signatures crypto paper</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:randombit/b:5aad553b935d/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:winternitz"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:hash"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:signatures"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:crypto"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:paper"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://grouper.ieee.org/groups/1363/Research/contributions/hao-ryan-2008.pdf">
    <title>Password Authenticated Key Exchange by Juggling</title>
    <dc:date>2010-11-09T15:53:19+00:00</dc:date>
    <link>http://grouper.ieee.org/groups/1363/Research/contributions/hao-ryan-2008.pdf</link>
    <dc:creator>randombit</dc:creator><dc:subject>crypto protocol paper keyexchange</dc:subject>
<dc:identifier>https://pinboard.in/u:randombit/b:ae365ff9d23d/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:crypto"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:protocol"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:paper"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:keyexchange"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://lasecwww.epfl.ch/pub/lasec/doc/CHVV03.ps">
    <title>Password Interception in a SSL/TLS Channel</title>
    <dc:date>2010-11-09T14:12:55+00:00</dc:date>
    <link>http://lasecwww.epfl.ch/pub/lasec/doc/CHVV03.ps</link>
    <dc:creator>randombit</dc:creator><dc:subject>crypto paper ssl protocol</dc:subject>
<dc:identifier>https://pinboard.in/u:randombit/b:18e11cc2a9a4/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:crypto"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:paper"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:ssl"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:protocol"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://ronja.twibright.com/optar/">
    <title>Twibright Optar</title>
    <dc:date>2010-08-08T14:08:12+00:00</dc:date>
    <link>http://ronja.twibright.com/optar/</link>
    <dc:creator>randombit</dc:creator><dc:subject>storage archive paper</dc:subject>
<dc:identifier>https://pinboard.in/u:randombit/b:ece4ed663a18/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:storage"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:archive"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:paper"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://eprint.iacr.org/2010/389">
    <title>The impossibility of computationally sound XOR</title>
    <dc:date>2010-07-09T20:23:30+00:00</dc:date>
    <link>http://eprint.iacr.org/2010/389</link>
    <dc:creator>randombit</dc:creator><dc:subject>theory crypto paper xor wtf</dc:subject>
<dc:identifier>https://pinboard.in/u:randombit/b:5f35052dc41b/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:crypto"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:paper"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:xor"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:wtf"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.cs.berkeley.edu/~daw/papers/pcmodel-long.pdf">
    <title>The Program Counter Security Model: Automatic Detection and Removal of Control-Flow Side Channel Attacks</title>
    <dc:date>2010-04-30T15:34:09+00:00</dc:date>
    <link>http://www.cs.berkeley.edu/~daw/papers/pcmodel-long.pdf</link>
    <dc:creator>randombit</dc:creator><dc:subject>crypto paper sidechannel</dc:subject>
<dc:identifier>https://pinboard.in/u:randombit/b:b46d0b686668/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:crypto"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:paper"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:sidechannel"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://tuprints.ulb.tu-darmstadt.de/2094/1/thesis.lehmann.pdf">
    <title>On the Security of Hash Function Combiners</title>
    <dc:date>2010-04-16T11:19:40+00:00</dc:date>
    <link>http://tuprints.ulb.tu-darmstadt.de/2094/1/thesis.lehmann.pdf</link>
    <dc:creator>randombit</dc:creator><dc:subject>hash crypto paper combiners</dc:subject>
<dc:identifier>https://pinboard.in/u:randombit/b:b52a1451eaf9/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:hash"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:crypto"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:paper"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:combiners"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://dslab.epfl.ch/pubs/crashonly/crashonly.pdf">
    <title>Crash-Only Software</title>
    <dc:date>2010-04-14T16:22:30+00:00</dc:date>
    <link>http://dslab.epfl.ch/pubs/crashonly/crashonly.pdf</link>
    <dc:creator>randombit</dc:creator><description><![CDATA[Crash-only programs crash safely and recover quickly. There is only one way to stop such softwary - by crashing it - and only one way to bring it up - by initiating recovery.
]]></description>
<dc:subject>crashonly reliability security systems programming paper</dc:subject>
<dc:identifier>https://pinboard.in/u:randombit/b:417b525b2b6a/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:crashonly"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:reliability"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:security"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:systems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:programming"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:paper"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://eprint.iacr.org/2010/193">
    <title>eprint 2010/193: Speeding Up The Widepipe: Secure and Fast Hashing</title>
    <dc:date>2010-04-09T16:26:00+00:00</dc:date>
    <link>http://eprint.iacr.org/2010/193</link>
    <dc:creator>randombit</dc:creator><dc:subject>crypto paper hashfunction</dc:subject>
<dc:identifier>https://pinboard.in/u:randombit/b:80eb1eb3549c/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:crypto"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:paper"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:hashfunction"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://eprint.iacr.org/2010/038">
    <title>Fault Resistant RSA Signatures: Chinese Remaindering in Both Directions</title>
    <dc:date>2010-01-26T06:52:36+00:00</dc:date>
    <link>http://eprint.iacr.org/2010/038</link>
    <dc:creator>randombit</dc:creator><description><![CDATA[Describes a trick to use CRT for checking RSA private key operations (normally you use the public operation)
]]></description>
<dc:subject>crypto paper rsa</dc:subject>
<dc:identifier>https://pinboard.in/u:randombit/b:498c4523dbee/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:crypto"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:paper"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:rsa"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://math.ucr.edu/home/baez/rosetta.pdf">
    <title>Physics, Topology, Logic and Computation: A Rosetta Stone</title>
    <dc:date>2010-01-06T13:31:32+00:00</dc:date>
    <link>http://math.ucr.edu/home/baez/rosetta.pdf</link>
    <dc:creator>randombit</dc:creator><dc:subject>computation topology logic physics mathematics paper</dc:subject>
<dc:identifier>https://pinboard.in/u:randombit/b:c48d04cb76e5/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:computation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:topology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:logic"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:physics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:mathematics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:paper"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://people.reed.edu/~crandall/papers/parrho.pdf">
    <title>Parallelization of Pollard-rho factorization</title>
    <dc:date>2009-12-02T05:17:04+00:00</dc:date>
    <link>http://people.reed.edu/~crandall/papers/parrho.pdf</link>
    <dc:creator>randombit</dc:creator><dc:subject>paper pollard rho factorization numbertheory</dc:subject>
<dc:identifier>https://pinboard.in/u:randombit/b:aacfa2a81b2e/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:paper"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:pollard"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:rho"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:factorization"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:numbertheory"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://eprint.iacr.org/2009/251">
    <title>ePrint 2009/251 - Format-Preserving Encryption</title>
    <dc:date>2009-11-05T06:01:00+00:00</dc:date>
    <link>http://eprint.iacr.org/2009/251</link>
    <dc:creator>randombit</dc:creator><description><![CDATA[A technique for encrypting an arbitrary set onto itself (for instance from valid CC numbers to valid CC numbers).
]]></description>
<dc:subject>fpe crypto paper</dc:subject>
<dc:identifier>https://pinboard.in/u:randombit/b:9391964e64d3/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:fpe"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:crypto"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:paper"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://eprint.iacr.org/2009/389">
    <title>On the Security of 1024-bit RSA and 160-bit Elliptic Curve Cryptography</title>
    <dc:date>2009-08-16T12:58:47+00:00</dc:date>
    <link>http://eprint.iacr.org/2009/389</link>
    <dc:creator>randombit</dc:creator><dc:subject>crypto paper</dc:subject>
<dc:identifier>https://pinboard.in/u:randombit/b:0b9ec9580617/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:crypto"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:paper"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.59.9389">
    <title>Parallel Collision Search with Cryptanalytic Applications</title>
    <dc:date>2009-07-24T07:04:08+00:00</dc:date>
    <link>http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.59.9389</link>
    <dc:creator>randombit</dc:creator><dc:subject>crypto hashfunction paper</dc:subject>
<dc:identifier>https://pinboard.in/u:randombit/b:ffe52580d494/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:crypto"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:hashfunction"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:paper"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.35.1538">
    <title>The Insecurity of the Digital Signature Algorithm with Partially Known Nonces</title>
    <dc:date>2009-07-17T16:28:00+00:00</dc:date>
    <link>http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.35.1538</link>
    <dc:creator>randombit</dc:creator><description><![CDATA[Turns out that ~100 signature/message pairs with only the 3 low bits of the random k nonce is sufficient to recover the private key. Nice analysis.
]]></description>
<dc:subject>crypto dsa lattices paper</dc:subject>
<dc:identifier>https://pinboard.in/u:randombit/b:779e4850bfc9/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:crypto"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:dsa"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:lattices"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:paper"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.9013">
    <title>CiteSeerX — GOST 34.10 - A. brief overview of Russia's DSA</title>
    <dc:date>2009-03-27T04:07:12+00:00</dc:date>
    <link>http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.9013</link>
    <dc:creator>randombit</dc:creator><dc:subject>gost paper</dc:subject>
<dc:identifier>https://pinboard.in/u:randombit/b:47d5b9ed4724/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:gost"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:paper"/>
</rdf:Bag></taxo:topics>
</item>
</rdf:RDF>