不正検知可能な準最適 (2, 2, n) ランプ型秘密分散

In this research, we consider a strong ramp secret sharing scheme that can detect cheating. A cheating-detectable (k, L, n) ramp secret sharing scheme has been studied so far, and a strong ramp secret sharing scheme which achieves lower bounds on the size of shares and random number used in encoding (i. e., share generation), and the success probability of impersonation attack has been presented. Now a challenging task is to achieve the lower bound on the success probability of substitution attack.In this paper, we present a strong (2, 2, n) ramp secret sharing scheme that almost achieves the lower bound on the success probability of substitution attack. The proposed scheme is the first to almost achieve the lower bound. Moreover the proposed scheme also achieves other lower bounds such as those on the size of shares and random number used in encoding, and the success probability of impersonation attack. We take a unique strategy to construct the scheme. Most existing works present generic type verification functions which can detect cheating for any linear and strong (k, L, n) ramp scheme. On the other hand, our proposed verification function (one of those which we call limited type verification functions) can detect cheating when used with a linear and strong (2, 2, n) ramp scheme satisfying a certain property

Election Security Is Harder Than You Think

Recent years have seen the rise of nation-state interference in elections across the globe, making the ever-present need for more secure elections all the more dire. While certain common-sense approaches have been a typical response in the past, e.g. ``don't connect voting machines to the Internet'' and ``use a voting system with a paper trail'', known-good solutions to improving election security have languished in relative obscurity for decades. These techniques are only now finally being implemented at scale, and that implementation has brought the intricacies of sophisticated approaches to election security into full relief. This dissertation argues that while approaches to improve election security like paper ballots and post-election audits seem straightforward, in reality there are significant practical barriers to sufficient implementation. Overcoming these barriers is a necessary condition for an election to be secure, and while doing so is possible, it requires significant refinement of existing techniques. In order to better understand how election security technology can be improved, I first develop what it means for an election to be secure. I then delve into experimental results regarding voter-verified paper, discussing the challenges presented by paper ballots as well as some strategies to improve the security they can deliver. I examine the post-election audit ecosystem and propose a manifest improvement to audit workload analysis through parallelization. Finally, I show that even when all of these conditions are met (as in a vote-by-mail scenario), there are still wrinkles that must be addressed for an election to be truly secure.PHDComputer Science & EngineeringUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://deepblue.lib.umich.edu/bitstream/2027.42/163272/1/matber_1.pd

Semantic discovery and reuse of business process patterns

Patterns currently play an important role in modern information systems (IS) development and their use has mainly been restricted to the design and implementation phases of the development lifecycle. Given the increasing significance of business modelling in IS development, patterns have the potential of providing a viable solution for promoting reusability of recurrent generalized models in the very early stages of development. As a statement of research-in-progress this paper focuses on business process patterns and proposes an initial methodological framework for the discovery and reuse of business process patterns within the IS development lifecycle. The framework borrows ideas from the domain engineering literature and proposes the use of semantics to drive both the discovery of patterns as well as their reuse

Netprov

Netprov is an emerging interdisciplinary digital art form that offers a literature-based “show” of insightful, healing satire that is as deep as the novels of the past. This accessible history of Netprov emerges out of an ongoing conversation about the changing roles and power dynamics of author and reader in an age of real-time interactivity. Rob Wittig describes a literary genre in which all the world is a platform and all participants are players. Beyond serving as a history of the genre, this book includes tips and examples to help those new to the genre teach and create netprovs

Sharon Pollock

As playwright, actor, director, teacher, mentor, theatre administrator, and critic, Sharon Pollock has played an integral role in the shaping of Canada's national theatre tradition, and she continues to produce new works and to contribute to Canadian theatre as passionately as she has done over the past fifty years. Pollock is nationally and internationally respected for her work and support of the theatre community. She has also played a major role in informing Canadians about the "dark side" of their history and current events. This collection, comprised entirely of new and original assessments of her work and contribution to theatre, is both timely and long overdue. Includes a new play titled "Sharon's Tongue" by the Playing with Pollock Collective With contributions by: Kathy K. Y. Chung Donna Coates Carmen Derksen Sherrill Grace Martin Morrow Jeton Neziraj Wes Pearce Tanya Schaap Shelley Scott Jerry Wasserman Jason Weins Cynthia Zimmerma