<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
		>
<channel>
	<title>Comments on: MBTA Hack: Is It Really This Easy?</title>
	<atom:link href="http://www.veracode.com/blog/2008/08/mbta-hack-is-it-really-this-easy/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.veracode.com/blog/2008/08/mbta-hack-is-it-really-this-easy/</link>
	<description>Application security testing, analysis, and metrics</description>
	<lastBuildDate>Thu, 09 Feb 2012 11:59:00 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.1</generator>
	<item>
		<title>By: Anton Aylward</title>
		<link>http://www.veracode.com/blog/2008/08/mbta-hack-is-it-really-this-easy/comment-page-1/#comment-2026</link>
		<dc:creator>Anton Aylward</dc:creator>
		<pubDate>Thu, 21 Aug 2008 22:23:46 +0000</pubDate>
		<guid isPermaLink="false">http://www.veracode.com/blog/?p=238#comment-2026</guid>
		<description>Compare this with the system used by the Toronto Transit Corporation.
The &#039;pass&#039; is for a given period and allows unlimited travel in that period.  As such the gates only have to check to see if the pass is used within its valid timeframe.

The economics of this are obviously different.  See http://www3.ttc.ca/

A commuter will make 2 trips a day at $2.75, minimum, so there is a small saving.  But the TTC benefits from a plan that gives a predictable cash flow.  The consumer also benefits from the convenience of the pass for extra &#039;incidental&#039; trips.   No doubt the overall economic analysis also takes into account that this is an incentive to use the transit system compared to driving.

Regardless: what I find interesting is how different cities seem to come to different conclusions and use different economic models given much the same data about commuters.</description>
		<content:encoded><![CDATA[<p>Compare this with the system used by the Toronto Transit Corporation.<br />
The &#8216;pass&#8217; is for a given period and allows unlimited travel in that period.  As such the gates only have to check to see if the pass is used within its valid timeframe.</p>
<p>The economics of this are obviously different.  See <a href="http://www3.ttc.ca/" rel="nofollow">http://www3.ttc.ca/</a></p>
<p>A commuter will make 2 trips a day at $2.75, minimum, so there is a small saving.  But the TTC benefits from a plan that gives a predictable cash flow.  The consumer also benefits from the convenience of the pass for extra &#8216;incidental&#8217; trips.   No doubt the overall economic analysis also takes into account that this is an incentive to use the transit system compared to driving.</p>
<p>Regardless: what I find interesting is how different cities seem to come to different conclusions and use different economic models given much the same data about commuters.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Brandon Creighton</title>
		<link>http://www.veracode.com/blog/2008/08/mbta-hack-is-it-really-this-easy/comment-page-1/#comment-2012</link>
		<dc:creator>Brandon Creighton</dc:creator>
		<pubDate>Fri, 15 Aug 2008 17:57:17 +0000</pubDate>
		<guid isPermaLink="false">http://www.veracode.com/blog/?p=238#comment-2012</guid>
		<description>If the value isn&#039;t stored on the card, then the system isn&#039;t able to collect fares when the network isn&#039;t available (say, a bus is in a tunnel, or the network is down).  That doesn&#039;t mean that the system shouldn&#039;t or couldn&#039;t check a centralized card database, encrypt the data, or even use a checksum with an effective possible entropy greater than 6 bits (even SYSV sum(1) gives you 16 bits).

In short:  as they implied in their recommendations, the problem isn&#039;t with a) or b), it&#039;s with c) and d).  

Even with crypto, there are still plenty of points of attack -- if you think IKE is complicated, try working out the logistics of key distribution for fare readers and buses from Providence to Newburyport.  

One question I&#039;m curious about that isn&#039;t explicitly mentioned in either the presentation or the recommendations is: do the CharlieTickets have machine-readable unique IDs that are tracked by the fare readers?  If this isn&#039;t the case, the resulting attack doesn&#039;t even require a magstripe reader:  Buy a card; slice the important tracks into two (or more if you&#039;re lucky) identical pieces; re-assemble each onto a new card; and go to town.  There&#039;s a breakdown of the fields in the slides, but I&#039;m not sure whether or not it&#039;s a complete description of the card.

By the way, since apparently no journalist has bothered to dig this far (even though it&#039;s mentioned in the presentation slides), the contractors responsible for the MBTA&#039;s system are &lt;a href=&quot;http://www.oti.co.il/content.aspx?id=263&quot; rel=&quot;nofollow&quot;&gt;Scheidt &amp; Bachmann/OTI&lt;/a&gt;.  S&amp;B is also responsible for the awesome LIRR/Metro-North card system that &lt;a href=&quot;http://www.nytimes.com/2008/08/13/nyregion/13scam.html?em&quot; rel=&quot;nofollow&quot;&gt;lets users buy cards even if their debit cards don&#039;t have enough money to cover the cost&lt;/a&gt;.</description>
		<content:encoded><![CDATA[<p>If the value isn&#8217;t stored on the card, then the system isn&#8217;t able to collect fares when the network isn&#8217;t available (say, a bus is in a tunnel, or the network is down).  That doesn&#8217;t mean that the system shouldn&#8217;t or couldn&#8217;t check a centralized card database, encrypt the data, or even use a checksum with an effective possible entropy greater than 6 bits (even SYSV sum(1) gives you 16 bits).</p>
<p>In short:  as they implied in their recommendations, the problem isn&#8217;t with a) or b), it&#8217;s with c) and d).  </p>
<p>Even with crypto, there are still plenty of points of attack &#8212; if you think IKE is complicated, try working out the logistics of key distribution for fare readers and buses from Providence to Newburyport.  </p>
<p>One question I&#8217;m curious about that isn&#8217;t explicitly mentioned in either the presentation or the recommendations is: do the CharlieTickets have machine-readable unique IDs that are tracked by the fare readers?  If this isn&#8217;t the case, the resulting attack doesn&#8217;t even require a magstripe reader:  Buy a card; slice the important tracks into two (or more if you&#8217;re lucky) identical pieces; re-assemble each onto a new card; and go to town.  There&#8217;s a breakdown of the fields in the slides, but I&#8217;m not sure whether or not it&#8217;s a complete description of the card.</p>
<p>By the way, since apparently no journalist has bothered to dig this far (even though it&#8217;s mentioned in the presentation slides), the contractors responsible for the MBTA&#8217;s system are <a href="http://www.oti.co.il/content.aspx?id=263" rel="nofollow">Scheidt &amp; Bachmann/OTI</a>.  S&amp;B is also responsible for the awesome LIRR/Metro-North card system that <a href="http://www.nytimes.com/2008/08/13/nyregion/13scam.html?em" rel="nofollow">lets users buy cards even if their debit cards don&#8217;t have enough money to cover the cost</a>.</p>
]]></content:encoded>
	</item>
</channel>
</rss>

