18 Hits in 10.0 sec

Concurrently Composable Security with Shielded Super-Polynomial Simulators [chapter]

Brandon Broadnax, Nico Döttling, Gunnar Hartung, Jörn Müller-Quade, Matthias Nagel
2017 Lecture Notes in Computer Science  
As in previous frameworks, our notion is based on the idea of providing the simulator with super-polynomial resources.  ...  We propose a new framework for concurrently composable security that relaxes the security notion of UC security.  ...  network messages.  ... 
doi:10.1007/978-3-319-56620-7_13 fatcat:h6ihumklf5dqxdqbd26jiexpue

Verifying message-passing programs with dependent behavioural types

Alceste Scalas, Nobuko Yoshida, Elias Benussi
2019 Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation - PLDI 2019  
The λ π ⩽ -Calculus The theoretical basis of our work is a λ-calculus extended with channels, input/output, and parallel composition, called λ π ⩽ .  ...  . shared-memory concurrency, but do not ensure that a program implements a given specification.  ...  Notably, p is bound by a dependent function type [16] .  ... 
doi:10.1145/3314221.3322484 dblp:conf/pldi/ScalasYB19 fatcat:o64i4g4flfbx7kkvbrz3ppyyp4

Efficient Agreement Protocols in Asynchronous Distributed Systems

Izabela Moise
2011 2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum  
On the contrary, a synchronous model, implies timing bounds on the actions performed by the processes and on message transfer delays.  ...  The total number of messages consists of the following: one estimate message sent by p 1 to all, n − 1 replies from p 2 , p 3 , ..., p n to p 1 and one decide message sent by p 1 to all, which leads to  ...  Dans une seconde version, nous avons considéré que la génération d'une proposition p j conduisait à une collision avec une probabilité décroissante au fil de l'exécution du consensus c (égale à 1 au début  ... 
doi:10.1109/ipdps.2011.367 dblp:conf/ipps/Moise11 fatcat:lhpjl76et5bk7lpimxhy32pptq

CONFLLVM: A Compiler for Enforcing Data Confidentiality in Low-Level Code [article]

Ajay Brahmakshatriya, Piyus Kedia, Derrick Paul McKee, Pratik Bhatu, Deepak Garg, Akash Lal, Aseem Rastogi
2019 arXiv   pre-print
We have implemented our scheme as part of the LLVM compiler.  ...  The compiler then uses a static flow analysis coupled with efficient runtime instrumentation, a custom memory layout, and custom control-flow integrity checks to prevent data leaks even in the presence  ...  We consider C applications that work with both private and public data. Applications interact with the external world using the network, disk, and other channels.  ... 
arXiv:1711.11396v3 fatcat:pv6jpzcytncjllnm7v76ae4viy

VIBE: An energy efficient routing protocol for dense and mobile sensor networks

Aris Papadopoulos, Alfredo Navarra, Julie A. McCann, Cristina M. Pinotti
2012 Journal of Network and Computer Applications  
A sensor network may deploy a huge number of nodes depending on the nature of the application.  ...  Typically a sensor board consists of a number of sensors of different modalities which, when combined with a microprocessor and a low-power radio transceiver, forms a smart network-enabled node.  ...  We are researching other ways, apart from in-network data aggregation, to implement this principle on the routing level.  ... 
doi:10.1016/j.jnca.2011.05.004 fatcat:q5l7wcxbh5hxbmg2bcd6ihoiaq

Model Checking of Component Connectors

Mohammad Izadi, Ali Movaghar, Farhad Arbab
2007 Computer Software and Applications Conference (COMPSAC) Proceedings of the IEEE International  
The expressiveness of CTL is not comparable to that of LTL. For example, the LTL formula p is not expressible in CTL, while the CTL formula AA p is not expressible in LTL.  ...  The nodes of a Reo network represent sets of channel ends.  ... 
doi:10.1109/compsac.2007.153 dblp:conf/compsac/IzadiMA07 fatcat:lysriwrovfalxdsge5jm7xxuvi

An ontology toolkit for problem domain concept location in program comprehension

Nuno Ramos Carvalho
2013 2013 35th International Conference on Software Engineering (ICSE)  
During this work, a set of frameworks and libraries were developed, including generic methods and tool composi ons, that allowed the implementa on of the described approach in a elegant (simple but effec  ...  To undertake these tasks a sufficient understanding of the system (or at least a part of it) is required.  ...  p j | (t j , p j ) ← terms A,A , p j > p ] Where, ptd is a func on, that given a PTD from language A to B, and a term t, computes a set of pairs, where each pair contains a term that is a possible transla  ... 
doi:10.1109/icse.2013.6606731 dblp:conf/icse/Carvalho04 fatcat:yn2f7zjtifhmvi2x4yzprvoumy

Cryptographic Protocols from Physical Assumptions

Alexander Koch
Marc Fischlin for offering to serve as a second reviewer of the thesis.  ...  Acknowledgements First of all, I would like to express my deepest gratitude to my supervisor, Prof. Dr.  ...  Using the isolation assumptions that come with these channel types, one can define what it means to be connected (by a path through the network) to "the outside" at a given point in time.  ... 
doi:10.5445/ir/1000097756 fatcat:vtwuxy4kzreuhm7wwce6fsegze

Coded caching over realistic and scalable wireless networks [article]

Mozhgan Bayat, Giuseppe Caire, Technische Universität Berlin
This dissertation goes beyond the unrealistic bottleneck network and extends the MAN scheme to a class of two-hop wireless networks consisting of one server connected via fronthaul links to a layer of  ...  Furthermore, a scalable video streaming service with two different qualities was implemented using the proposed delivery scheme, allowing users with better channel quality to decode a high quality version  ...  quasi-lower bound C qlb k,ℓ (Φ) on the ergodic mutual information for a given geometry Φ yields a true lower bound C lb k,ℓ on the average (w.r.t. the random geometry) ergodic mutual information. At  ... 
doi:10.14279/depositonce-10832 fatcat:6k3jmkrfqnhghe63xxwtpf4kgu

Against Frontier Sustainability (or, Breaking Up with The High Frontier) [chapter]

Jessie Beier
2021 Right Research  
The voicemail messages, with different voices and various qualities of transmission (like real voicemail messages) put us on the phone with the future.  ...  N 2 ). 16 When this happened value increased dramatically for companies that made use of networked machines to add value.  ...  This will help achieve a higher quality video with a much smaller size. • Using Quicktime (for mac users): Open the video in Quicktime. Choose File > Export > ipad, iphone, ipad touch & apple TV >  ... 
doi:10.11647/obp.0213.17 fatcat:bpot6y3b4rduxm7pmqclqfuwwe

Sparse recovery based grant-free random access for massive machine-type communication

Alexander Fengler, Peter Jung, Giuseppe Caire, Technische Universität Berlin
The assumption of a common codebook allows to treat the random access problem in a way that captures the effect of short messages while still taking into account the physical properties of the channel.  ...  The idea of unsourced random access is to go one step further and, ideally, abolish the identification step, such that active devices directly transmit a message from a common predefined message set.  ...  A simple upper bound on the entropy of the 2 J -ary vector OR-channel can be obtained by the sum of the marginal entropies of 2 J independent binary-input binary-output channels.  ... 
doi:10.14279/depositonce-11526 fatcat:23taezpgpvdgdjbtpmp2jpscze

Compositional design and verification of component-based information systems [article]

Werf, JMEM (Jan Martijn) Van Der, Sidorova, N (Natalia), Scheper, WJ (Wim), Reisig, W (Wolfgang), Hee, KM (Kees) Van
One of the main aspects of such a network is that organizations do not want to share with whom they are communicating.  ...  messages, and on the other hand the possibility of verification remains.  ...  Activities can communicate with other components by sending messages over output channels and collecting messages from input channels. In this thesis, we use Petri nets to implement a process.  ... 
doi:10.6100/ir693452 fatcat:43j4xgtrzbgkjothdheonjvimu

Privacy-preserving web single sign-on : formal security analysis and design [article]

Guido Schmitz, Universität Stuttgart, Universität Stuttgart
So far, only one SSO system has been proposed with this kind of privacy in mind: Mozilla's BrowserID (a.k.a. Mozilla Persona).  ...  As a result of this first rigorous analysis of an SSO system in the Web infrastructure, we find severe attacks. These attacks not only af [...]  ...  Let BID p be a fixed BrowserID primary mode Web system with a network attacker. Then, BID p is secure w.r.t. authentication.  ... 
doi:10.18419/opus-10880 fatcat:ggiojebwdbfblptdcmzezukpum

Privacy-Preserving Remote Attestation Protocol

Dominik Roy George, Georg Merzdovnik, Edgar Weippl
Binary Attestation (BA) is a security mechanism which has existed for decades. The goal of BA is to guarantee that the correct software is loaded on a computer system.  ...  Later on, a remote party is able to verify the evidence if the operational state of the target system is trustworthy, in a process known as Remote Attestation (RA).  ...  curveo ver F p .L et P and Q be points on M A↪B .  ... 
doi:10.34726/hss.2021.86825 fatcat:tkopxzh5pvbcnohvhf5cztqogq

Approximate Inference: New Visions

Yingzhen Li, Richard Eric Turner, Apollo-University Of Cambridge Repository, Apollo-University Of Cambridge Repository
Critically, the success of Bayesian methods in practice, including the recent resurgence of Bayesian deep learning, relies on fast and accurate approximate Bayesian inference applied to probabilistic models  ...  Both approaches provide a unifying view of existing variational methods from different algorithmic perspectives.  ...  Then one can define A(p(z z z|D)) = q φ φ φ (z z z|D) with e.g. a neural network, and then optimise the associated variational parameters φ φ φ on the datasets D 1 , ..., D N .  ... 
doi:10.17863/cam.24865 fatcat:weiquqeeejbmdb3zyccd3j4vpy
« Previous Showing results 1 — 15 out of 18 results