Browsing CSAIL Technical Reports (July 1, 2003 - present) by Title
Now showing items 734-753 of 775
-
Updatable Zero-Knowledge Sets
(2003-10-14)We build on the work of Micali, Rabin, and Killian [4] to introduce zero-knowledge sets and databases that may be updated in a desirable way. In particular, in order to make an update the owner of the set must publish a ... -
A Useful Homomorphic Encryption Method
(2009-06-15) -
A User Study Comparing 3D Modeling with Silhouettes and Google SketchUp
(2010-05-05)We describe a user study comparing 3D Modeling with Silhouettes and Google SketchUp. In the user study, ten users were asked to create 3D models of three different objects, using either 3D Modeling with Silhouettes or ... -
Using Active Learning to Synthesize Models of Applications That Access Databases
(2018-08-28)We present a new technique that uses active learning to infer models of applications that manipulate relational databases. This technique comprises a domain-specific language for modeling applications that access ... -
Using Code Perforation to Improve Performance, Reduce Energy Consumption, and Respond to Failures
(2009-09-03)Many modern computations (such as video and audio encoders, Monte Carlo simulations, and machine learning algorithms) are designed to trade off accuracy in return for increased performance. To date, such computations ... -
Using computational models to study texture representations in the human visual system.
(2005-02-07)Traditionally, human texture perception has been studied using artificial textures made of random-dot patterns or abstract structured elements. At the same time, computer algorithms for the synthesis of natural textures ... -
Using Cyclic Memory Allocation to Eliminate Memory Leaks
(2005-10-26)We present and evaluate a new memory management technique foreliminating memory leaks in programs with dynamic memoryallocation. This technique observes the execution of the program on asequence of training inputsto find ... -
Using Dynamic Monitoring to Synthesize Models of Applications That Access Databases
(2018-09-27)We previously developed Konure, a tool that uses active learning to infer the functionality of database applications. An alternative approach is to observe the inputs, outputs, and database traffic from a running ... -
Using Probabilistic I/O Automata to Analyze an Oblivious Transfer Protocol
(2006-06-19)We demonstrate how to carry out cryptographic security analysis ofdistributed protocols within the Probabilistic I/O Automataframework of Lynch, Segala, and Vaandrager. This framework providestools for arguing rigorously ... -
Using Probabilistic I/O Automata to Analyze an Oblivious Transfer Protocol
(2005-08-19)We demonstrate how to carry out cryptographic security analysis ofdistributed protocols within the Probabilistic I/O Automata frameworkof Lynch, Segala, and Vaandrager.This framework provides tools for arguing rigorously ... -
Using Program Synthesis for Social Recommendations
(2012-08-13)This paper presents a new approach to select events of interest to a user in a social media setting where events are generated by the activities of the user's friends through their mobile devices. We argue that given the ... -
Using Task-Structured Probabilistic I/O Automata to Analyze an Oblivious Transfer Protocol
(2007-02-16)The Probabilistic I/O Automata framework of Lynch, Segala and Vaandrager provides tools for precisely specifying protocols and reasoning about their correctness using multiple levels of abstraction, based on implementation ... -
Using Task-Structured Probabilistic I/O Automata to Analyze an Oblivious Transfer Protocol
(2006-06-20)The Probabilistic I/O Automata framework of Lynch, Segala and Vaandrager provides tools for precisely specifying protocols and reasoning about theircorrectness using multiple levels of abstraction, based on implementation ... -
Using Task-Structured Probabilistic I/O Automata to Analyze an Oblivious Transfer Protocol
(2006-03-08)AbstractThe Probabilistic I/O Automata framework of Lynch, Segala and Vaandrager provides tools for precisely specifying protocols and reasoning about their correctness using multiple levels of abstraction, based on ... -
Using The Barton Libraries Dataset As An RDF benchmark
(2007-07-06)This report describes the Barton Libraries RDF dataset and Longwell querybenchmark that we use for our recent VLDB paper on Scalable Semantic WebData Management Using Vertical Partitioning. -
Value-Deviation-Bounded Serial Data Encoding for Energy-Efficient Approximate Communication
(2015-06-04)Transferring data between ICs accounts for a growing proportion of system power in wearable and mobile systems. Reducing signal transitions reduces the dynamic power dissipated in this data transfer, but traditional ... -
Verifiably Secure Devices
(2007-12-05)We put forward the notion of a verifiably secure device, in essence a stronger notion of secure computation, and achieve it in the ballot-box model. Verifiably secure devices1. Provide a perfect solution to the problem of ... -
Verification of Semantic Commutativity Conditions and Inverse Operations on Linked Data Structures
(2010-12-03)Commuting operations play a critical role in many parallel computing systems. We present a new technique for verifying commutativity conditions, which are logical formulas that characterize when operations commute. Because ... -
Verifying Quantitative Reliability of Programs That Execute on Unreliable Hardware
(2013-06-19)Emerging high-performance architectures are anticipated to contain unreliable components that may exhibit soft errors, which silently corrupt the results of computations. Full detection and recovery from soft errors is ... -
Verifying the Correctness of Wide-Area Internet Routing
(2004-05-17)Several studies have shown that wide-area Internet routing is fragile, with failures occurring for a variety of reasons. Routing fragility is largely due to the flexible and powerful ways in which BGP can be configured to ...