Sciweavers

1816 search results - page 90 / 364
» Trace oblivious computation
Sort
View
112
Voted
WISEC
2010
ACM
15 years 6 months ago
Privacy-preserving computation of benchmarks on item-level data using RFID
Currently, companies are about to optimize their internal processes by monitoring items they handle with Radio Frequency Identification (RFID). However, there is a risk that sens...
Florian Kerschbaum, Nina Oertel, Leonardo Weiss Fe...
97
Voted
FOCS
2005
IEEE
15 years 6 months ago
Cryptography In the Bounded Quantum-Storage Model
We initiate the study of two-party cryptographic primitives with unconditional security, assuming that the adversary’s quantum memory is of bounded size. We show that oblivious ...
Ivan Damgård, Serge Fehr, Louis Salvail, Chr...
80
Voted
MFCS
1993
Springer
15 years 4 months ago
Deterministic Behavioural Models for Concurrency
Abstract This paper offers three candidates for a deterministic, noninterleaving, behaviour model which generalizes Hoare traces to the noninterleaving situation. The three models...
Vladimiro Sassone, Mogens Nielsen, Glynn Winskel
95
Voted
CSR
2006
Springer
15 years 4 months ago
Unfolding Synthesis of Asynchronous Automata
Zielonka's theorem shows that each regular set of Mazurkiewicz traces can be implemented as a system of synchronized processes provided with some distributed control structure...
Nicolas Baudru, Rémi Morin
101
Voted
EDOC
2008
IEEE
15 years 2 months ago
Runtime Monitoring of Message-Based Workflows with Data
We present an algorithm for the runtime monitoring of business process properties with data parameterization. The properties are expressed in LTL-FO+ , an extension to traditional...
Sylvain Hallé, Roger Villemaire