Google is responsible for giving birth to tools that have changed the entire world: Google search, Gmail, Android and so forth. It should be celebrated! However, Google is also responsible for the death of many of its own products as it re-focuses its priorities: Google Labs, Google Reader and many other less celebrated Google products. It should be charged with murder!
     |
PlanetSide 2 sweet potato casserole Pumpkin Pie Recipe wii u wii u American Music Awards turkey brine
Military technology doesn't simply spring forth fully formed from a DARPA engineer's head like some GI Athena. It requires extensive development cycles and field testing before it's put on the front lines. At this year's semi-annual Network Integration Evaluations (NIE) at the White Sands Missile Range, in New Mexico, Army researchers put a trio of technologies through their paces. Technologies that could radically alter how future wars are waged by delivering a more complete battlefield view to troops in the line of fire.
| |
masterchef Dictionary.com Chicago teachers strike september 11 2001 september 11 2001 blake lively Espn Fantasy Football
![[ Back to EurekAlert! ]](https://lh3.googleusercontent.com/blogger_img_proxy/AEn0k_tWmKtmyNhY8e-uuFR5hFLjChXStMrNYsvLxO4NGGAnO3iTj5aigx-ZVbyQ9Gg3DFQ4II6Uppej14zZ7g8TQnY6Rt1rsz-GaiVyQx-4l2s=s0-d){kind=small}
Public release date: 2-Jul-2013
Share ] Contact: Andrew Carleen
acarleen@mit.edu
617-253-1682
Massachusetts Institute of Technology
CAMBRIDGE, Mass -- Cloud computing -- outsourcing computational tasks over the Internet -- could give home-computer users unprecedented processing power and let small companies launch sophisticated Web services without building massive server farms.
But it also raises privacy concerns. A bank of cloud servers could be running applications for 1,000 customers at once; unbeknownst to the hosting service, one of those applications might have no purpose other than spying on the other 999.
Encryption could make cloud servers more secure. Only when the data is actually being processed would it be decrypted; the results of any computations would be re-encrypted before they're sent off-chip.
In the last 10 years or so, however, it's become clear that even when a computer is handling encrypted data, its memory-access patterns -- the frequency with which it stores and accesses data at different memory addresses can betray a shocking amount of private information.
At the International Symposium on Computer Architecture in June, MIT researchers described a new type of secure hardware component, dubbed Ascend, that would disguise a server's memory-access patterns, making it impossible for an attacker to infer anything about the data being stored. Ascend also thwarts another type of attack, known as a timing attack, which attempts to infer information from the amount of time that computations take.
Computational trade-off
Similar designs have been proposed in the past, but they've generally traded too much computational overhead for security. "This is the first time that any hardware design has been proposed -- it hasn't been built yet -- that would give you this level of security while only having about a factor of three or four overhead in performance," says Srini Devadas, the Edwin Sibley Webster Professor of Electrical Engineering and Computer Science, whose group developed the new system. "People would have thought it would be a factor of 100."
The "trivial way" of obscuring memory-access patterns, Devadas explains, would be to request data from every address in the memory -- whether a memory chip or a hard drive -- and throw out everything except the data stored at the one address of interest. But that would be much too time-consuming to be practical.
What Devadas and his collaborators -- graduate students Ling Ren, Xiangyao Yu and Christopher Fletcher, and research scientist Marten van Dijk do instead is to arrange memory addresses in a data structure known as a "tree." A family tree is a familiar example of a tree, in which each "node" (in this example, a person's name) is attached to only one node above it (the node representing the person's parents) but may connect to several nodes below it (the person's children).
With Ascend, addresses are assigned to nodes randomly. Every node lies along some "path," or route through the tree, that starts at the top and passes from node to node, without backtracking, until arriving at a node with no further connections. When the processor requires data from a particular address, it sends requests to all the addresses in a path that includes the one it's really after.
To prevent an attacker from inferring anything from sequences of memory access, every time Ascend accesses a particular memory address, it randomly swaps that address with one stored somewhere else in the tree. As a consequence, accessing a single address multiple times will very rarely require traversing the same path.
Less computation to disguise an address
By confining its dummy requests to a single path, rather than sending them to every address in memory, Ascend exponentially reduces the amount of computation required to disguise an address. In a separate paper, which is as-yet unpublished but has been posted online, the researchers prove that querying paths provides just as much security as querying every address in memory would.
Ascend also protects against timing attacks. Suppose that the computation being outsourced to the cloud is the mammoth task of comparing a surveillance photo of a criminal suspect to random photos on the Web. The surveillance photo itself would be encrypted, and thus secure from prying eyes. But spyware in the cloud could still deduce what public photos it was being compared to. And the time the comparisons take could indicate something about the source photos: Photos of obviously different people could be easy to rule out, but photos of very similar people might take longer to distinguish.
So Ascend's memory-access scheme has one final wrinkle: It sends requests to memory at regular intervals -- even when the processor is busy and requires no new data. That way, attackers can't tell how long any given computation is taking.
###
Written by Larry Hardesty, MIT News Office
[ | E-mail | Share ] ?
AAAS and EurekAlert! are not responsible for the accuracy of news releases posted to EurekAlert! by contributing institutions or for the use of any information through the EurekAlert! system.
Public release date: 2-Jul-2013 Share ] Contact: Andrew Carleen
acarleen@mit.edu
617-253-1682
Massachusetts Institute of Technology
CAMBRIDGE, Mass -- Cloud computing -- outsourcing computational tasks over the Internet -- could give home-computer users unprecedented processing power and let small companies launch sophisticated Web services without building massive server farms.
But it also raises privacy concerns. A bank of cloud servers could be running applications for 1,000 customers at once; unbeknownst to the hosting service, one of those applications might have no purpose other than spying on the other 999.
Encryption could make cloud servers more secure. Only when the data is actually being processed would it be decrypted; the results of any computations would be re-encrypted before they're sent off-chip.
In the last 10 years or so, however, it's become clear that even when a computer is handling encrypted data, its memory-access patterns -- the frequency with which it stores and accesses data at different memory addresses can betray a shocking amount of private information.
At the International Symposium on Computer Architecture in June, MIT researchers described a new type of secure hardware component, dubbed Ascend, that would disguise a server's memory-access patterns, making it impossible for an attacker to infer anything about the data being stored. Ascend also thwarts another type of attack, known as a timing attack, which attempts to infer information from the amount of time that computations take.
Computational trade-off
Similar designs have been proposed in the past, but they've generally traded too much computational overhead for security. "This is the first time that any hardware design has been proposed -- it hasn't been built yet -- that would give you this level of security while only having about a factor of three or four overhead in performance," says Srini Devadas, the Edwin Sibley Webster Professor of Electrical Engineering and Computer Science, whose group developed the new system. "People would have thought it would be a factor of 100."
The "trivial way" of obscuring memory-access patterns, Devadas explains, would be to request data from every address in the memory -- whether a memory chip or a hard drive -- and throw out everything except the data stored at the one address of interest. But that would be much too time-consuming to be practical.
What Devadas and his collaborators -- graduate students Ling Ren, Xiangyao Yu and Christopher Fletcher, and research scientist Marten van Dijk do instead is to arrange memory addresses in a data structure known as a "tree." A family tree is a familiar example of a tree, in which each "node" (in this example, a person's name) is attached to only one node above it (the node representing the person's parents) but may connect to several nodes below it (the person's children).
With Ascend, addresses are assigned to nodes randomly. Every node lies along some "path," or route through the tree, that starts at the top and passes from node to node, without backtracking, until arriving at a node with no further connections. When the processor requires data from a particular address, it sends requests to all the addresses in a path that includes the one it's really after.
To prevent an attacker from inferring anything from sequences of memory access, every time Ascend accesses a particular memory address, it randomly swaps that address with one stored somewhere else in the tree. As a consequence, accessing a single address multiple times will very rarely require traversing the same path.
Less computation to disguise an address
By confining its dummy requests to a single path, rather than sending them to every address in memory, Ascend exponentially reduces the amount of computation required to disguise an address. In a separate paper, which is as-yet unpublished but has been posted online, the researchers prove that querying paths provides just as much security as querying every address in memory would.
Ascend also protects against timing attacks. Suppose that the computation being outsourced to the cloud is the mammoth task of comparing a surveillance photo of a criminal suspect to random photos on the Web. The surveillance photo itself would be encrypted, and thus secure from prying eyes. But spyware in the cloud could still deduce what public photos it was being compared to. And the time the comparisons take could indicate something about the source photos: Photos of obviously different people could be easy to rule out, but photos of very similar people might take longer to distinguish.
So Ascend's memory-access scheme has one final wrinkle: It sends requests to memory at regular intervals -- even when the processor is busy and requires no new data. That way, attackers can't tell how long any given computation is taking.
###
Written by Larry Hardesty, MIT News Office
[ | E-mail | Share ] ?
AAAS and EurekAlert! are not responsible for the accuracy of news releases posted to EurekAlert! by contributing institutions or for the use of any information through the EurekAlert! system.
Source: http://www.eurekalert.org/pub_releases/2013-07/miot-nhd070213.php
michael mcdonald jon jones vs rashad evans earth day 2012 jon jones rashad evans ufc jones vs evans watergate pregnant man
58 minutes ago
Dave Kotinsky / Getty Images
Farrah Abraham will spend the next 10 days in a Florida rehab center.
"Teen Mom" star Farrah Abraham checked into a Florida rehab center late Sunday night, but not before video-blogging her car ride to the airport on her Keek site.
Abraham, who in the video said she was "sad" to leave her daughter, Sophia, will be spending the next nine days at The Lukens Institute, a luxury rehab facility in Palm Beach, Fla., recommended to Abraham's manager by Michael Lohan.
?(Farrah's manager) contacted me regarding Farrah and the treatment program The Lukens Institute offers," Lohan told TODAY.com. "It?s very individualized core issue and trauma therapy."
In a statement, Abraham said that completing an intensive outpatient program was required to satisfy the terms of her probation stemming from her March DWI arrest.
"I must complete in order to get off of probation, due to my DWI received in March earlier this year," Abraham said. "At this time in my life I need to stay focused on the positive to get through all of these negatives that this DWI has caused in my life. I?m 22 and I want to make better choices and insure I can recognize when I?m putting myself in a bad situation next time."
According to a document obtained by Radar Online, Phyllis Moczygemba, the executive director of the Austin Drug & Alcohol Abuse Program, recommended that Abraham complete a 60-hour intensive outpatient program. In the state-mandated evaluation, Moczygemba reported that Abraham had difficulty making eye contact, and that she was standoffish and "sarcastic when answering the questions asked of her."
Abraham's sister, Ashley Danielson, thinks entering the program is a positive start. "She?s going to rehab to avoid jail, but I?m happy she?s finally taking responsibility for her own actions,? Danielson told TODAY.com.
The reality personality won't exactly be roughing it during her rehab stay. "At The Lukens Institute, your room is like living in a suite at the Ritz Carlton," Lohan said.
This has been quite the year for Abraham. Following her March DWI arrest, she starred in a porn movie with adult film star James Deen, and has been making appearances at strip clubs and erotica conventions across the country to promote the film. Her stay in rehab will not conflict with any of her scheduled appearances.
?Our accelerated program is designed for motivated, high-functioning individuals with demanding careers and busy schedules who want private, individualized care, as well as a high degree of personal freedom," The Lukens Institute said in a statement.
Abraham won't have much time to reflect on her rehab experience. Three days after she is scheduled to check out of the facility, she will be making an appearance at the EXXXOTICA Chicago convention, followed by an appearance at Vivid's Gentlemen's Club in Charlotte, N.C.
But for now, she's happy to be getting help.
Michelle Shocked ncaa bracket bracket Jason Terry Steubenville rape Beyonce Bow Down Jason Molina
Here's a nice little feature for those of us who love to post images on the internet. Bing has added the ability to refine image results by license. The addition's simple enough to use -- just do a search and pull the appropriate license from a drop down on the top of the results page, alongside options for date, size and color. Selections include public domain and options like "free to modify, share and use," based on the Creative Commons licensing system, so there's no doubt as to precisely how you can incorporate them into your own posts. Google's had a similar option on its own search engine for some time -- albeit one's that's a bit less prominently displayed.
Filed under: Internet, Software, Microsoft
Source: Bing Blog
Source: http://feeds.engadget.com/~r/weblogsinc/engadget/~3/0SX3Iyeg_OM/
Karrueche Tran miguel cabrera dodd frank Lark Voorhies Jennifer Livingston Orlando Cruz MLB Playoff Schedule
Getty ImagesWe?re rolling out our own list of the Top 100 players in the NFL this month, with the first 25 names unveiled today.
Although this wasn?t our intention (the list is ordered solely based on the way our panel of NFL media members cast their votes), the first name we?re unveiling, at No. 76, happens to be a player whose presence on the list will be the subject of a great deal of debate. We?re sure plenty of you will agree, plenty will disagree, and you?ll have a lot to say in the comments.
The Bottom 25 of PFT?s Top 100 are below.
76 Tony Romo, quarterback, Cowboys
77 Doug Martin, running back, Buccaneers
78 Frank Gore, running back, 49ers
79 Carl Nicks, guard, Buccaneers
80 Maurice Jones-Drew, running back, Jaguars
81 Vernon Davis, tight end, 49ers
82 Evan Mathis, guard, Eagles
83 Alfred Morris, running back, Redskins
84 Joe Haden, cornerback, Browns
85 C.J. Spiller, running back, Bills
86 Calais Campbell, defensive end, Cardinals
87 Matthew Stafford, quarterback, Lions
88 Antonio Cromartie, cornerback, Jets
89 Jason Peters, offensive tackle, Eagles
90 Jordan Gross, offensive tackle, Panthers
91 Mike Pouncey, center, Dolphins
92 Mike Wallace, receiver, Dolphins
93 Reggie Wayne, receiver, Colts
94 Ed Reed, safety, Texans
95 Henry Melton, defensive tackle, Bears
96 Lance Briggs, linebacker, Bears
97 Steve Smith, receiver, Panthers
98 Antoine Winfield, cornerback, Seahawks
99 Max Unger, center, Seahawks
100 Matt Forte, running back, Bears
London Olympics Kristen Stewart Rupert Sanders Photos 2016 Olympics TD Bank mountain lion hanley ramirez Christian Bale visits victims
