检索结果-内蒙古大学图书馆

Constructions and Properties of k out of n Visual Secret Sharing Schemes

Designs, Codes, and Cryptography 1997年第2期11卷 179-196页

作者： Verheul, Eric R. Van Tilborg, Henk C. A. Ministry of the Interior 2500 EA the Hague P.O. Box 20010 Netherlands Dept. of Math. and Computing Science Eindhoven University of Technology 5600 MB Eindhoven P.O. Box 513 Netherlands

The idea of visual k out of n secret sharing schemes was introduced in [4]. Explicit constructions for k = 2 and k = n can be found there. For general k out of n schemes bounds have been described. Here, two general k out of n constructions are presented. Their parameters are related to those of maximum size arcs or MDS codes. Further, results on the structure of k out of n schemes, such as bounds on their parameters, are obtained. Finally, the notion of coloured visual secret sharing schemes is introduced and a general construction is given.

关键词： Arcs MDS codes Secret sharing schemes Visual cryptography

来源：评论

学校读者我要写书评

暂无评论

Binding cryptography - A fraud-detectible alternative to key-escrow proposals

引用

Computer Law and Security Report 1997年第1期13卷 3-14页

作者： Verheul, Eric Koops, Bert-Jaap Van Tilborg, Henk Ministry of the Interior 2500 EA The Hague PO Box 20010 Netherlands Ctr. Law Admin. and Informatisation Tilburg University 5000 LE Tilburg PO Box 90153 Netherlands Dept. of Math. and Computing Science Eindhoven University of Technology 5600 MB Eindhoven PO Box 513 Netherlands Tilburg University Eindhoven University of Technology Netherlands Department of Discrete Mathematics Eindhoven University of Technology Netherlands

Information security, and so cryptography, is essential in today's information society. A robust worldwide information security infrastructure must be set up, including a Key Management Infrastructure. However, the unconditional use of encryption by criminals poses a threat to law enforcement. Consequently, governments have two tasks. The first is stimulating the establishment of a security infrastructure that protects their citizens, but which does not facilitate criminals to shield their activities from law-enforcement agencies. The second task is coping with the use of encryption by criminals in general - outside of this infrastructure. In this article, Eric Verheul, Bert-Jaap Koops and Henk van Tilborg address the first task. The authors review several (technical) proposals and a few government initiatives, focusing on key-escrow proposals. They present a series of criteria that acceptable solutions should meet, and note that all proposals so far fail to meet many of these criteria. The establishment of a worldwide security infrastructure cannot be achieved without strong cooperation of governments. In fact, the authors argue, governments themselves should take up the challenge of establishing a security infrastructure based on public-key encryption, which does not hamper law enforcement. The authors offer a new solution to achieve this, "binding data", which improves upon current proposals. It helps the establishment of a strong security infrastructure in which (unilateral) fraud (i.e. not complying with the agreed rules) for criminal or subversive purposes is discouraged;such abuse is difficult and detectible by arbitrary parties. The proposal allows a straightforward monitoring of compliance with law-enforcement regulations, without users having to deposit keys beforehand. This security infrastructure does not solve criminal encryption use outside of this framework - it is not meant to. Criminals can use encryption anyhow;they should only be kept from gaining

关键词：

来源：评论

学校读者我要写书评

暂无评论

Two approaches to optimal annealing 97

Two approaches to optimal annealing

引用

Proceedings of the 11th International Conference on Neural Information Processing Systems

作者： Todd K. Leen Bernhard Schottky David Saad Dept of Compo Sci. & Engineering Oregon Graduate Institute of Science and Technology Portland Oregon Neural Computing Research Group Dept of Compo Sci. & Appl. Math. Aston University Birmingham UK

We employ both master equation and order parameter approaches to analyze the asymptotic dynamics of on-line learning with different learning rate annealing schedules. We examine the relations between the results obtained by the two approaches and obtain new results on the optimal decay coefficients and their dependence on the number of hidden nodes in a two layer architecture.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A short and elementary proof of the main Bahadur-Kiefer theorem

引用

ANNALS OF PROBABILITY 1996年第1期24卷 526-531页

作者： Einmahl, JHJ Dept. of Math. and Computing Science Eindhoven University of Technology 5600 MB Eindhoven P.O. Box 513 Netherlands

A short proof of the lower bound in the strong version of the famous Theorem IA in Kiefer (1970) on the Bahadur-Kiefer process is presented. The proof is elementary and, in particular, does not use strong approximations.

关键词： Bahadur-Kiefer process empirical and quantile process strong law

来源：评论

学校读者我要写书评

暂无评论

Canonical typing and Π-conversion in the Barendregt Cube

引用

Journal of Functional Programming 1996年第2期6卷 245-267页

作者： Kamareddine, Fairouz Nederpelt, Rob Department of Computing Science University of Glasgow Glasgow G12 8QQ 17 Lilybank Gardens United Kingdom Dept. of Math. and Computing Science Eindhoven University of Technology 5600 MB Eindhoven P.O.Box 513 Netherlands

In this article, we extend the Barendregt Cube with Π-conversion (which is the analogue of β-conversion, on product type level) and study its properties. We use this extension to separate the problem of whether a te...

关键词：

来源：评论

学校读者我要写书评

暂无评论

On the use of destination set grouping to improve fairness in multicast video distribution

On the use of destination set grouping to improve fairness i...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： Shun Yan Cheung M.H. Ammar Xue Li Department of Math. and Computer Science Emory University Atlanta GA USA College of Computing Georgia Institute of Technology Atlanta GA USA

In a fair multicast video distribution scheme each receiver should receive a video stream with a quality that is commensurate with its capabilities or the capabilities of the path leading to it, regardless of other receivers or network paths. This fairness problem results from the fact that multicast communication trades economy of bandwidth with granularity of control. Distributing video using individual feedback-controlled point-to-point streams results in high bandwidth utilization but the granularity of control is high as communication parameters can be negotiated individually with each receiver. In contrast, using a single multicast stream has good bandwidth economy, but very low granularity of control. In this paper we propose, implement and experiment with a system that spans the spectrum represented by the two extremes above. In the scheme, called destination set grouping (DSG), a source maintains a small number of video streams, carrying the same video but each targeted at receivers with different capabilities. Each stream is feedback-controlled within prescribed limits by its group of receivers. Receivers may move among streams as their capabilities or the capabilities of the network paths leading to them change. The scheme is shown to improve fairness significantly at a small bandwidth cost.

关键词： Streaming media Feedback Bandwidth Communication system control Computer networks Distributed computing Prototypes Educational institutions Costs IP networks

来源：评论

学校读者我要写书评

暂无评论

Remembering Wim Vervaat

引用

Statistica Neerlandica 1996年第1期50卷 225-230页

作者： Maassen, H. Steutel, F.W. Dept. of Mathematics University of Nijmegen 6525 ED Nijmegen Toernooiveld 1 Netherlands Dept. of Math. and Computing Science Eindhoven University of Technology 5600 MB Eindhoven P.O. Box 513 Netherlands

来源：评论

学校读者我要写书评

暂无评论

Creation of adhesion resistant silica glass surfaces with ultraviolet laser cleaning

Creation of adhesion resistant silica glass surfaces with ul...

引用

Conference on Optoelectronic and Microelectronic Materials and Devices

作者： D.R. Hafpenny D.M. Kane R.N. Lamb B. Gong Sch. of Math. Phys. Comput. & Electron. Macquarie Univ. North Ryde NSW Australia School of Mathematics Physics Computing and Electronics Macquarie University NSW Australia Surface Science and Technology University of New South Wales Sydney Australia

By using the ultraviolet irradiation from a frequency doubled copper vapour laser, in the fluence range used for laser cleaning, the surface chemistry of silica can be modified. Analysis has shown that the surface is dehydroxylated by the UV light changing it from hydrophilic to hydrophobic in nature. The modification of the surface has the effect of reducing the number of particles that adhere to the treated surface by up to 80%, for 0.3 /spl mu/m diameter particles, upon subsequent contamination of the surface.

关键词： Adhesives Silicon compounds Glass Surface treatment Surface contamination Chemical lasers Frequency Copper Cleaning Surface emitting lasers

来源：评论

学校读者我要写书评

暂无评论

Benchmarking implementations of functional languages with 'Pseudoknot', a float-intensive benchmark

引用

Journal of Functional Programming 1996年第4期6卷 621-655页

作者： Hartel, Pieter H. Feeley, Marc Alt, Martin Augustsson, Lennart Baumann, Peter Beemster, Marcel Chailloux, Emmanuel Flood, Christine H. Grieskamp, Wolfgang Van Groningen, John H. G. Hammond, Kevin Hausman, Bogumil Ivory, Melody Y. Jones, Richard E. Kamperman, Jasper Lee, Peter Leroy, Xavier Lins, Rafael D. Loosemore, Sandra Röjemo, Niklas Serrano, Manuel Talpin, Jean-Pierre Thackray, Jon Thomas, Stephen Walters, Pum Weis, Pierre Wentworth, Peter Department of Computer Systems University of Amsterdam 1098 SJ Amsterdam Kruislaan 403 Netherlands Dept. d'Informatique et R.o. Université de Montréal Montréal Que. H3C 3J7 succursale centre-ville Canada Informatik Universität des Saarlandes 66041 Saarbrücken 11 Germany Department of Computer Systems Chalmers University of Technology 412 96 Göteborg Sweden Department of Computer Science University of Zurich 8057 Zurich Winterthurerstr. 190 Switzerland LIENS URA 1327 du CNRS Ecl. Normale Supérieure 75230 Paris Cédex 05 45 rue d'Ulm France Laboratory for Computer Science MIT Cambridge MA 02139 545 Technology Square United States Berlin University of Technology 10587 Berlin Franklinstr. 28-29 Germany Fac. of Math. and Computer Science Univ. of Nijmegen 6525 ED Nijmegen Toernooiveld 1 Netherlands Department of Computing Science Glasgow University Glasgow G12 8QQ 17 Ulybank Gardens United Kingdom Computer Science Lab. Box 1505 S-125 25 Älvsjö Sweden Computer Research Group Inst. for Sci. Computer Research Lawrence Livermore Natl. Laboratory Livermore CA 94550 P.O. Box 808 L-419 United States Department of Computer Science University of Kent at Canterbury Canterbury Kent CT2 7NF United Kingdom CWl 1098 SJ Amsterdam Kruislaan 413 Netherlands Department of Computer Science Carnegie Mellon University Pittsburgh PA 15213 5000 Forbes Avenue United States INRIA Rocquencourt Projet Cristal 78153 Le Chesnay B.P. 105 France Departamento de Informática Universidade Federal de Pernambuco Recife PE Brazil Department of Computer Science Yale University New Haven CT United States INRIA Rocquencourt Projet Icsla 78153 Le Chesnay B.P. 105 France Europ. Comp.-Indust. Research Centre D-81925 Munich Arabella Straße 17 Germany Harlequin Ltd. Barrington Hall Barrington Cambridge CB2 5RG United Kingdom Department of Computer Science University of Nottingham Nottingham NG7 2RD United Kingdom Department of Computer Science Rhodes University Grahamstown

Over 25 implementations of different functional languages are benchmarked using the same program, a floating-point intensive application taken from molecular biology. The principal aspects studied are compile time and execution time for the various implementations that were benchmarked. An important consideration is how the program can be modified and tuned to obtain maximal performance on each language implementation. With few exceptions, the compilers take a significant amount of time to compile this program, though most compilers were faster than the then current GNU C compiler (GCC version 2.5.8). Compilers that generate C or Lisp are often slower than those that generate native code directly: the cost of compiling the intermediate form is normally a large fraction of the total compilation time. There is no clear distinction between the runtime performance of eager and lazy implementations when appropriate annotations are used: lazy implementations have clearly come of age when it comes to implementing largely strict applications, such as the Pseudoknot program. The speed of C can be approached by some implementations, but to achieve this performance, special measures such as strictness annotations are required by non-strict implementations. The benchmark results have to be interpreted with care. Firstly, a benchmark based on a single program cannot cover a wide spectrum of 'typical' applications. Secondly, the compilers vary in the kind and level of optimisations offered, so the effort required to obtain an optimal version of the program is similarly varied.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Model checking using adaptive state and data abstraction 6th

Model checking using adaptive state and data abstraction

引用

6th International Conference on Computer Aided Verification, CAV 1994

作者： Dams, Dennis Gerth, Rob Döhmen, Gert Herrmann, Ronald Kelb, Peter Pargmann, Hergen Eindhoven University of Technology Dept. of Math. and Computing Science P.O. Box 513 Eindhoven5600 MB Netherlands OFFIS Westerstraße 10-12 Oldenburg26111 Germany University of Oldenburg Oldenburg26121 Germany

ISBN: (纸本)9783540581796

We present a partitioning algorithm for checking ACTL specifications that distinguishes between states only if this is necessary to ascertain the specification. This algorithm is then generalized to also abstract from the variable values in the states. Here, too, the values between which the algorithm distinguishes are determined by what is needed to decide whether or not the specification holds. The resulting algorithm is being implemented in an ROBDD based model checker for VHDL/S. © Springer-Verlag Berlin Heidelberg 1994.

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：