نتایج جستجو برای: threshold access structures

تعداد نتایج: 880041  

2015
Rossitza N. Irobalieva Jonathan M. Fogg Daniel J. Catanese Thana Sutthibutpong Muyuan Chen Anna K. Barker Steven J. Ludtke Sarah A. Harris Michael F. Schmid Wah Chiu Lynn Zechiedrich

By regulating access to the genetic code, DNA supercoiling strongly affects DNA metabolism. Despite its importance, however, much about supercoiled DNA (positively supercoiled DNA, in particular) remains unknown. Here we use electron cryo-tomography together with biochemical analyses to investigate structures of individual purified DNA minicircle topoisomers with defined degrees of supercoiling...

Journal: :IACR Cryptology ePrint Archive 2010
Ching-Fang Hsu Qi Cheng

In secret sharing, the exact characterization of ideal access structures is a longstanding open problem. Brickell and Davenport (J. of Cryptology, 1991) proved that ideal access structures are induced by matroids. Subsequently, ideal access structures and access structures induced by matroids have attracted a lot of attention. Due to the difficulty of finding general results, the characterizati...

Journal: :Journal of the Royal Asiatic Society 2023

Abstract Across the early modern Islamicate world, phenomenon of eunuch slavery constitutes a significant aspect courtly contexts and royal households. Although Mughal historiography has focused on primarily in relation to harem, this article analyses function such figures regulating elite male space, order explore how these practices shaped both representation life as well dynamics animating c...

Journal: :Indonesian Journal of Electrical Engineering and Computer Science 2023

Decoders are one of the significant peripheral components static random-access memory (SRAM). As CMOS technology moves towards nano scale regime, leakage power starts dominating dynamic power. In this paper, we propose decoders using NAND logic in 32 nm technology. Leakage is reduced by employing dual-threshold technique. Dual thresholding a technique that uses transistors two different thresho...

2016
Andrej Bogdanov Siyao Guo Ilan Komargodski

We prove that for every n and 1 < t < n any t-out-of-n threshold secret sharing scheme for one-bit secrets requires share size log(t + 1). Our bound is tight when t = n− 1 and n is a prime power. In 1990 Kilian and Nisan proved the incomparable bound log(n − t + 2). Taken together, the two bounds imply that the share size of Shamir’s secret sharing scheme (Comm. ACM ’79) is optimal up to an add...

2006
Wenjian Shao Dongxu Shen Daiqin Yang Victor K. Li

The original power controlled multiple access (PCMA) protocol does not support service differentiation. In this paper, we extend PCMA to form a new media access control protocol supporting service differentiation in mobile ad hoc networks. To support QoS, we first introduce the in-station access category concept in 802.11e to PCMA. For service differentiation between access categories, our majo...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید