Secrecy in Science

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Secrecy logic: S -secrecy structures

Let S = 〈L, S〉 be a deductive system. An S -secrecy logic is a quadruple K = 〈FmL(V ),K,B, S〉 , where FmL(V ) is the algebra of L-formulas, K,B are S -theories, with B ⊆ K and S ⊆ K such that S ∩ B = ∅ . K corresponds to information deducible from a knowledge base, B to information deducible from the publicly accessible (or browsable) part of the knowledge base and S is a secret set, a set of s...

متن کامل

Secrecy-Preserving Reasoning using Secrecy Envelopes

Inmany applications of networked information systems, the need to share information often has to be balanced against the need to protect secret information from unintended disclosure, e.g., due to copyright, privacy, security, or commercial considerations. We study the problem of secrecy-preserving reasoning, that is, answering queries using secret information, whenever it is possible to do so,...

متن کامل

Secrecy in Untrusted Networks

We investigate the protection of migrating agents against the untrusted sites they traverse. The resulting calculus provides a formal framework to reason about protection policies and security protocols over distributed, mobile infrastructures, and aims to stand to ambients as the spi calculus stands to π. We present a type system that separates trusted and untrusted data and code, while allowi...

متن کامل

Secrecy in Mobile Code

Mobile code is code that can be executed at a remote location, where beforehand it might not be known whether this location is trustworthy and a requirement may be that the to be executed code is encrypted and remains encrypted during execution. This paper presents a model of mobile code and defines perfect secrecy. The model and definition allows to derive conditions and theoretical boundaries...

متن کامل

Perfect Secrecy in Wireless Networks

In a classic paper, among a multitude of other security issues, Claude E. Shannon defined perfect secrecy for a pair of secure computers communicating over an insecure link. The present paper extends Shannon’s notion of perfect secrecy to ad hoc wireless networks of computers. All of the wireless transmissions are insecure. This paper assumes a secure base-station communicating wirelessly using...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Chemical & Engineering News Archive

سال: 1996

ISSN: 0009-2347,2157-4936

DOI: 10.1021/cen-v074n008.p005