- Subscribe to this page:
- RSS
- Email Alert
Saarland University
(42 results)-
White Papers
Acoustic Side-Channel Attacks on Printers
May 14, 2010, 12:00am PDT
This paper examines the problem of acoustic emanations of printers. The authors present a novel attack that recovers what a dot-matrix printer processing English text is printing based on a record...
Provided by Saarland University
-
White Papers
Secure Key-Updating for Lazy Revocation
June 8, 2006, 12:00am PDT
The authors consider the problem of efficient key management and user revocation in cryptographic file systems that allow shared access to files. A performance efficient solution to user...
Provided by Saarland University
-
White Papers
On the Security of Protocols With Logarithmic Communication Complexity
May 7, 2007, 12:00am PDT
This paper investigates the security of protocols with logarithmic communication complexity. The authors show that for the security definitions with environment, i.e., Reactive Simulatability and...
Provided by Saarland University
-
White Papers
Concurrent Composition in the Bounded Quantum Storage Model
April 23, 2010, 12:00am PDT
The authors define the BQS-UC model, a variant of the UC model that deals with protocols in the bounded quantum storage model. This paper presents a statistically secure commitment protocol in the...
Provided by Saarland University
-
White Papers
The GCX System: Dynamic Buffer Minimization in Streaming XQuery Evaluation
July 31, 2007, 12:00am PDT
In this paper, the authors present the main-memory based streaming XQuery engine GCX which implements novel buffer management strategies that combine static and dynamic analysis to keep main...
Provided by Saarland University
-
White Papers
A Provably Secure and Efficient Countermeasure Against Timing Attacks
May 7, 2009, 12:00am PDT
The authors show that the amount of information about the key that an unknown-message attacker can extract from a deterministic side-channel is bounded from above by |O| log2(n + 1) bits, where n...
Provided by Saarland University
-
White Papers
A Step-Indexed Semantics of Imperative Objects
March 3, 2009, 12:00am PST
Step-indexed semantic interpretations of types were proposed as an alternative to purely syntactic proofs of type safety using subject reduction. The types are interpreted as sets of values...
Provided by Saarland University
-
White Papers
Towards Key-Dependent Message Security in the Standard Model
January 13, 2008, 12:00am PST
Standard security notions for encryption schemes do not guarantee any security if the encrypted messages depend on the secret key. Yet it is exactly the stronger notion of security in the presence...
Provided by Saarland University
-
White Papers
Fast and Simple Relational Processing of Uncertain Data
July 11, 2007, 12:00am PDT
This paper introduces U-relations, a succinct and purely relational representation system for uncertain databases. U-relations support attribute-level uncertainty using vertical partitioning. If...
Provided by Saarland University
-
White Papers
On the Necessity of Rewinding in Secure Multiparty Computation
September 13, 2006, 12:00am PDT
The authors investigate whether security of multiparty computation in the information theoretic setting implies their security under concurrent composition. They show that security in the...
Provided by Saarland University
-
White Papers
Long-Term Security and Universal Composability
April 28, 2010, 12:00am PDT
Algorithmic progress and future technological advances threaten today's cryptographic protocols. This may allow adversaries to break a protocol retrospectively by breaking the underlying...
Provided by Saarland University
-
White Papers
Limits of the Reactive Simulatability/UC of Dolev-Yao Models With Hashes
May 1, 2007, 12:00am PDT
Automated tools such as model checkers and theorem provers for the analysis of security protocols typically abstract from cryptography by Dolev-Yao models, i.e., abstract term algebras replace the...
Provided by Saarland University
-
White Papers
CSAR: A Practical and Provable Technique to Make Randomized Systems Accountable
December 12, 2008, 12:00am PST
The authors describe CSAR, a novel technique for generating cryptographically strong, accountable randomness. Using CSAR, they can generate a pseudo-random sequence and a proof that the elements...
Provided by Saarland University
-
White Papers
Comparing UC Security Variants
July 1, 2011, 12:00am PDT
In this paper, the authors investigate the relations among various security notions. More precisely, they present a separation result between two variants of UC security definition: 1-bit...
Provided by Saarland University
-
White Papers
Provably Secure and Practical Onion Routing
June 9, 2011, 12:00am PDT
The onion routing network, Tor, is undoubtedly the most widely employed technology for anonymous web access. Although the underlying Onion Routing (OR) protocol's multi-pass cryptographic circuit...
Provided by Saarland University
-
White Papers
Achieving Security Despite Compromise Using Zero-Knowledge
March 16, 2009, 12:00am PDT
One of the important challenges when designing and analyzing cryptographic protocols is the enforcement of security properties in the presence of compromised participants. This paper presents a...
Provided by Saarland University
-
White Papers
Causality-Based Abstraction of Multiplicity in Security Protocols
February 23, 2007, 12:00am PST
This paper presents a novel technique for analyzing security protocols based on an abstraction of the program semantics. This technique is based on a novel structure called causal graph which...
Provided by Saarland University
-
White Papers
Speaker Recognition in Encrypted Voice Streams
July 1, 2010, 12:00am PDT
Transmitting voice communication over untrusted networks puts personal information at risk. Although voice streams are typically encrypted to prevent unwanted eavesdropping, additional features of...
Provided by Saarland University
-
White Papers
Formally Bounding the Side-Channel Leakage in Unknown-Message Attacks
July 15, 2008, 12:00am PDT
The authors propose a novel approach for quantifying a system's resistance to unknown-message side-channel attacks. The approach is based on a measure of the secret information that an attacker...
Provided by Saarland University
-
White Papers
Predicting Defects in SAP Java Code: An Experience Report
February 11, 2009, 12:00am PST
Which components of a large software system are the most defect-prone? In a study on a large SAP Java system, the authors evaluated and compared a number of defect predictors, based on code...
Provided by Saarland University
-
White Papers
Efficiency Wages, Financial Market Integration, And The Fiscal Multiplier
February 13, 2007, 12:00am PST
The authors have used a "New-open-economy macroeconomics" model featuring a labor-market friction in the form of efficiency wages to analyze the implication of financial market integration for the...
Provided by Saarland University
-
White Papers
Flying Yellow Elephant: Predictable and Efficient MapReduce in the Cloud
July 10, 2010, 12:00am PDT
Today, growing datasets require new technologies as standard technologies - such as parallel DBMSs - do not easily scale to such level. On the one side, there is the MapReduce paradigm allowing...
Provided by Saarland University
-
White Papers
Automated Synthesis of Privacy-Preserving Distributed Applications
December 2, 2011, 12:00am PST
One of the central challenges in the development of distributed systems is the design of cryptographic protocols that meet the desired functional requirements and enforce the intended security...
Provided by Saarland University
-
White Papers
Resource-Aware Authorization Policies for Statically Typed Cryptographic Protocols
May 1, 2011, 12:00am PDT
Type systems for authorization are a popular device for the specification and verification of security properties in cryptographic applications. Though promising, existing frameworks exhibit...
Provided by Saarland University
-
White Papers
Types for Security Protocols
November 26, 2009, 12:00am PST
The authors revise existing type-based analyses of security protocols by devising a core type system for secrecy, integrity and authentication in the setting of spi-calculus processes. These...
Provided by Saarland University
-
White Papers
Union and Intersection Types for Secure Protocol Implementations
February 5, 2011, 12:00am PST
The authors present a new type system for verifying the security of cryptographic protocol implementations. The type system combines prior work on refinement types, with union, intersection, and...
Provided by Saarland University
-
White Papers
G2C: Cryptographic Protocols From Goal-Driven Specifications
February 8, 2011, 12:00am PST
The authors present G2C, a goal-driven specification language for distributed applications. This language offers support for the declarative specification of functionality goals and security...
Provided by Saarland University
-
White Papers
A Security API for Distributed Social Networks
June 20, 2011, 12:00am PDT
The authors present a cryptographic framework to achieve access control, privacy of social relations, secrecy of resources, and anonymity of users in social networks. They illustrate their...
Provided by Saarland University
-
White Papers
Design and Verification of Anonymous Trust Protocols
April 3, 2009, 12:00am PDT
Over the last years, the Web has evolved into the premium forum for freely and anonymously disseminating and collecting information and opinions. However, the ability to anonymously exchange...
Provided by Saarland University
-
White Papers
The CASPA Tool: Causality-Based Abstraction for Security Protocol Analysis
April 21, 2008, 12:00am PDT
CASPA constitutes a push-button tool for automatically proving secrecy and authenticity properties of cryptographic protocols. The tool is grounded on a novel technique for causality-based...
Provided by Saarland University
-
White Papers
Type-Checking Zero-Knowledge
April 15, 2008, 12:00am PDT
This paper presents the first type system for statically analyzing security protocols that are based on zero-knowledge proofs. The authors show how several properties offered by zero-knowledge...
Provided by Saarland University
-
White Papers
A Calculus of Challenges and Responses
February 23, 2007, 12:00am PST
Language-based security has proved to be a salient technique for formally analyzing security protocols, since Abadi's seminal work on secrecy by typing up to modern techniques based on logics,...
Provided by Saarland University
-
White Papers
Nested Hoare Triples and Frame Rules for Higher-Order Store
September 28, 2011, 12:00am PDT
Separation logic is a Hoare-style logic for reasoning about programs with heap-allocated mutable data structures. As a step toward extending separation logic to high-level languages with ML-style...
Provided by Saarland University
-
Software
PicasSound 1.3 (Mobile)
August 4, 2011, 12:00am PDT
PicasSound recommends songs as soundtracks for given images. It is based on the knowledge of experienced movie directors, extracted from publicly available contemporary movies.
Provided by Saarland University
-
White Papers
On the Development and Formalization of an Extensible Code Generator for Real Life Security Protocols
January 29, 2012, 12:00am PST
This paper introduces Expi2Java, a new code generator for cryptographic protocols that translates models written in an extensible variant of the Spi calculus into executable code in a substantial...
Provided by Saarland University
-
White Papers
Multimodal Person Authentication on a Smartphone Under Realistic Conditions
January 1, 2012, 12:00am PST
Verification of a person's identity by the combination of more than one biometric trait strongly increases the robustness of person authentication in real applications. This is particularly the...
Provided by Saarland University
-
White Papers
Computational Soundness of Symbolic Zero-knowledge Proofs: Weaker Assumptions and Mechanized Verification
February 9, 2012, 12:00am PST
The abstraction of cryptographic operations by term algebras, called symbolic models, is essential in almost all tool-supported methods for analyzing security protocols. Significant progress was...
Provided by Saarland University
-
White Papers
Automatic Discovery and Quantification of Information Leaks
April 2, 2009, 12:00am PDT
Information-flow analysis is a powerful technique for reasoning about the sensitive information exposed by a program during its execution. The authors present the first automatic method for...
Provided by Saarland University
-
White Papers
Bytecode Testability Transformation
June 24, 2011, 12:00am PDT
Bytecode as produced by modern programming languages is well suited for search-based testing: Different languages compile to the same bytecode, bytecode is available also for third party...
Provided by Saarland University
-
White Papers
EXSYST: Search-Based GUI Testing
October 28, 2011, 12:00am PDT
Test generation tools commonly aim to cover structural artefacts of software, such as the source code or the user interface. However, focusing only on source code can lead to unrealistic or...
Provided by Saarland University
-
White Papers
EXSYST: Search-Based GUI Testing
October 28, 2011, 12:00am PDT
Test generation tools commonly aim to cover structural artefacts of software, such as the source code or the user interface. However, focusing only on source code can lead to unrealistic or...
Provided by Saarland University
-
White Papers
Bytecode Testability Transformation
June 24, 2011, 12:00am PDT
Bytecode as produced by modern programming languages is well suited for search-based testing: Different languages compile to the same bytecode, bytecode is available also for third party...
Provided by Saarland University
-
White Papers
Automatic Discovery and Quantification of Information Leaks
April 2, 2009, 12:00am PDT
Information-flow analysis is a powerful technique for reasoning about the sensitive information exposed by a program during its execution. The authors present the first automatic method for...
Provided by Saarland University
-
White Papers
Computational Soundness of Symbolic Zero-knowledge Proofs: Weaker Assumptions and Mechanized Verification
February 9, 2012, 12:00am PST
The abstraction of cryptographic operations by term algebras, called symbolic models, is essential in almost all tool-supported methods for analyzing security protocols. Significant progress was...
Provided by Saarland University
-
White Papers
Multimodal Person Authentication on a Smartphone Under Realistic Conditions
January 1, 2012, 12:00am PST
Verification of a person's identity by the combination of more than one biometric trait strongly increases the robustness of person authentication in real applications. This is particularly the...
Provided by Saarland University
-
White Papers
On the Development and Formalization of an Extensible Code Generator for Real Life Security Protocols
January 29, 2012, 12:00am PST
This paper introduces Expi2Java, a new code generator for cryptographic protocols that translates models written in an extensible variant of the Spi calculus into executable code in a substantial...
Provided by Saarland University
-
Software
PicasSound 1.3 (Mobile)
August 4, 2011, 12:00am PDT
PicasSound recommends songs as soundtracks for given images. It is based on the knowledge of experienced movie directors, extracted from publicly available contemporary movies.
Provided by Saarland University
-
White Papers
Nested Hoare Triples and Frame Rules for Higher-Order Store
September 28, 2011, 12:00am PDT
Separation logic is a Hoare-style logic for reasoning about programs with heap-allocated mutable data structures. As a step toward extending separation logic to high-level languages with ML-style...
Provided by Saarland University
-
White Papers
A Calculus of Challenges and Responses
February 23, 2007, 12:00am PST
Language-based security has proved to be a salient technique for formally analyzing security protocols, since Abadi's seminal work on secrecy by typing up to modern techniques based on logics,...
Provided by Saarland University
-
White Papers
Type-Checking Zero-Knowledge
April 15, 2008, 12:00am PDT
This paper presents the first type system for statically analyzing security protocols that are based on zero-knowledge proofs. The authors show how several properties offered by zero-knowledge...
Provided by Saarland University
-
White Papers
The CASPA Tool: Causality-Based Abstraction for Security Protocol Analysis
April 21, 2008, 12:00am PDT
CASPA constitutes a push-button tool for automatically proving secrecy and authenticity properties of cryptographic protocols. The tool is grounded on a novel technique for causality-based...
Provided by Saarland University
-
White Papers
Design and Verification of Anonymous Trust Protocols
April 3, 2009, 12:00am PDT
Over the last years, the Web has evolved into the premium forum for freely and anonymously disseminating and collecting information and opinions. However, the ability to anonymously exchange...
Provided by Saarland University
-
White Papers
A Security API for Distributed Social Networks
June 20, 2011, 12:00am PDT
The authors present a cryptographic framework to achieve access control, privacy of social relations, secrecy of resources, and anonymity of users in social networks. They illustrate their...
Provided by Saarland University
-
White Papers
G2C: Cryptographic Protocols From Goal-Driven Specifications
February 8, 2011, 12:00am PST
The authors present G2C, a goal-driven specification language for distributed applications. This language offers support for the declarative specification of functionality goals and security...
Provided by Saarland University
-
White Papers
Union and Intersection Types for Secure Protocol Implementations
February 5, 2011, 12:00am PST
The authors present a new type system for verifying the security of cryptographic protocol implementations. The type system combines prior work on refinement types, with union, intersection, and...
Provided by Saarland University
-
White Papers
Types for Security Protocols
November 26, 2009, 12:00am PST
The authors revise existing type-based analyses of security protocols by devising a core type system for secrecy, integrity and authentication in the setting of spi-calculus processes. These...
Provided by Saarland University
-
White Papers
Resource-Aware Authorization Policies for Statically Typed Cryptographic Protocols
May 1, 2011, 12:00am PDT
Type systems for authorization are a popular device for the specification and verification of security properties in cryptographic applications. Though promising, existing frameworks exhibit...
Provided by Saarland University
-
White Papers
Automated Synthesis of Privacy-Preserving Distributed Applications
December 2, 2011, 12:00am PST
One of the central challenges in the development of distributed systems is the design of cryptographic protocols that meet the desired functional requirements and enforce the intended security...
Provided by Saarland University
-
White Papers
Flying Yellow Elephant: Predictable and Efficient MapReduce in the Cloud
July 10, 2010, 12:00am PDT
Today, growing datasets require new technologies as standard technologies - such as parallel DBMSs - do not easily scale to such level. On the one side, there is the MapReduce paradigm allowing...
Provided by Saarland University
-
White Papers
Predicting Defects in SAP Java Code: An Experience Report
February 11, 2009, 12:00am PST
Which components of a large software system are the most defect-prone? In a study on a large SAP Java system, the authors evaluated and compared a number of defect predictors, based on code...
Provided by Saarland University
-
White Papers
Formally Bounding the Side-Channel Leakage in Unknown-Message Attacks
July 15, 2008, 12:00am PDT
The authors propose a novel approach for quantifying a system's resistance to unknown-message side-channel attacks. The approach is based on a measure of the secret information that an attacker...
Provided by Saarland University
-
White Papers
Speaker Recognition in Encrypted Voice Streams
July 1, 2010, 12:00am PDT
Transmitting voice communication over untrusted networks puts personal information at risk. Although voice streams are typically encrypted to prevent unwanted eavesdropping, additional features of...
Provided by Saarland University
-
White Papers
Causality-Based Abstraction of Multiplicity in Security Protocols
February 23, 2007, 12:00am PST
This paper presents a novel technique for analyzing security protocols based on an abstraction of the program semantics. This technique is based on a novel structure called causal graph which...
Provided by Saarland University
-
White Papers
Achieving Security Despite Compromise Using Zero-Knowledge
March 16, 2009, 12:00am PDT
One of the important challenges when designing and analyzing cryptographic protocols is the enforcement of security properties in the presence of compromised participants. This paper presents a...
Provided by Saarland University
-
White Papers
Provably Secure and Practical Onion Routing
June 9, 2011, 12:00am PDT
The onion routing network, Tor, is undoubtedly the most widely employed technology for anonymous web access. Although the underlying Onion Routing (OR) protocol's multi-pass cryptographic circuit...
Provided by Saarland University
-
White Papers
Comparing UC Security Variants
July 1, 2011, 12:00am PDT
In this paper, the authors investigate the relations among various security notions. More precisely, they present a separation result between two variants of UC security definition: 1-bit...
Provided by Saarland University
-
White Papers
CSAR: A Practical and Provable Technique to Make Randomized Systems Accountable
December 12, 2008, 12:00am PST
The authors describe CSAR, a novel technique for generating cryptographically strong, accountable randomness. Using CSAR, they can generate a pseudo-random sequence and a proof that the elements...
Provided by Saarland University
-
White Papers
Limits of the Reactive Simulatability/UC of Dolev-Yao Models With Hashes
May 1, 2007, 12:00am PDT
Automated tools such as model checkers and theorem provers for the analysis of security protocols typically abstract from cryptography by Dolev-Yao models, i.e., abstract term algebras replace the...
Provided by Saarland University
-
White Papers
Long-Term Security and Universal Composability
April 28, 2010, 12:00am PDT
Algorithmic progress and future technological advances threaten today's cryptographic protocols. This may allow adversaries to break a protocol retrospectively by breaking the underlying...
Provided by Saarland University
-
White Papers
On the Necessity of Rewinding in Secure Multiparty Computation
September 13, 2006, 12:00am PDT
The authors investigate whether security of multiparty computation in the information theoretic setting implies their security under concurrent composition. They show that security in the...
Provided by Saarland University
-
White Papers
Fast and Simple Relational Processing of Uncertain Data
July 11, 2007, 12:00am PDT
This paper introduces U-relations, a succinct and purely relational representation system for uncertain databases. U-relations support attribute-level uncertainty using vertical partitioning. If...
Provided by Saarland University
-
White Papers
Towards Key-Dependent Message Security in the Standard Model
January 13, 2008, 12:00am PST
Standard security notions for encryption schemes do not guarantee any security if the encrypted messages depend on the secret key. Yet it is exactly the stronger notion of security in the presence...
Provided by Saarland University
-
White Papers
A Step-Indexed Semantics of Imperative Objects
March 3, 2009, 12:00am PST
Step-indexed semantic interpretations of types were proposed as an alternative to purely syntactic proofs of type safety using subject reduction. The types are interpreted as sets of values...
Provided by Saarland University
-
White Papers
A Provably Secure and Efficient Countermeasure Against Timing Attacks
May 7, 2009, 12:00am PDT
The authors show that the amount of information about the key that an unknown-message attacker can extract from a deterministic side-channel is bounded from above by |O| log2(n + 1) bits, where n...
Provided by Saarland University
-
White Papers
The GCX System: Dynamic Buffer Minimization in Streaming XQuery Evaluation
July 31, 2007, 12:00am PDT
In this paper, the authors present the main-memory based streaming XQuery engine GCX which implements novel buffer management strategies that combine static and dynamic analysis to keep main...
Provided by Saarland University
-
White Papers
Concurrent Composition in the Bounded Quantum Storage Model
April 23, 2010, 12:00am PDT
The authors define the BQS-UC model, a variant of the UC model that deals with protocols in the bounded quantum storage model. This paper presents a statistically secure commitment protocol in the...
Provided by Saarland University
-
White Papers
On the Security of Protocols With Logarithmic Communication Complexity
May 7, 2007, 12:00am PDT
This paper investigates the security of protocols with logarithmic communication complexity. The authors show that for the security definitions with environment, i.e., Reactive Simulatability and...
Provided by Saarland University
-
White Papers
Secure Key-Updating for Lazy Revocation
June 8, 2006, 12:00am PDT
The authors consider the problem of efficient key management and user revocation in cryptographic file systems that allow shared access to files. A performance efficient solution to user...
Provided by Saarland University
-
White Papers
Acoustic Side-Channel Attacks on Printers
May 14, 2010, 12:00am PDT
This paper examines the problem of acoustic emanations of printers. The authors present a novel attack that recovers what a dot-matrix printer processing English text is printing based on a record...
Provided by Saarland University
-
White Papers
Middleware Support for Seamless Multimedia Home Entertainment for Mobile Users and Heterogeneous Environments
January 1, 2008, 12:00am PST
The emergence of mobile devices in multimedia home entertainment demands new application scenarios like ubiquitous multimedia access. However today's home entertainment appliances are usually...
Provided by Saarland University
Keep Up with TechRepublic
Upcoming Webcasts
Upcoming webcasts from leading IT vendors
-
2012-05-24 at 11:00 am PT | 2:00 pm ET
Live Webcast: The 2012 Guide to Better Business Benefits from Data Analytics
Sponsored by Tableau Software
-
2012-06-05 at 11:00 am PT | 2:00 pm ET
Live Webcast: Getting to Microsoft Office 365: The right migration for your business
Sponsored by Microsoft
-
2012-06-12 at 9:00 am PT | 12:00 pm ET
Live Webcast: WebSphere DataPower for Mobile Application Security
Sponsored by IBM
Submit a Paper
Get your content listed in our directory!
Our directory is the largest library of vendor-supplied technical content on the Web. It’s also the first place IT decision makers turn to when researching technology solutions. Our members are already finding your competitors’ papers here - shouldn’t they find yours, too? It's FREE so click here and submit your white paper, case study, data sheet, research report, or other document today!
