• No results found

Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming

N/A
N/A
Protected

Academic year: 2020

Share "Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming"

Copied!
19
0
0

Loading.... (view fulltext now)

Full text

Loading

Figure

Table 1: Our results for access structures on five participants
Table 2: Our results for graph access structures on six vertices
Figure 2: Graph access structures on 8 participants with κ(Γ) < λ(Γ).
Figure 3: AG(3, 2)′ and Q8
+2

References

Related documents

Free Download Write Can anyone know an app for download named - Windows Central Hours exe NT Kernel Disbursement Atmosphere Corporation ZwOpenObjectAuditAlarm 0x805F2C16

Thus, Charles met and became a close friend of Chapin, who introduced him to the ornithological staff of the American Museum of Natural History, with which he thenceforth

It is a consortium led by IIT-Kanpur and other members includes, the commonwealth of learning (col), the Indian institute of management-Calcutta (IIMC) and the

Compared to the initial investment of a SMEs, enterprises with rich investment experience are more likely to seek the existing large market, much cheap labor and rich

Bob’s contributions to the club over the past several years are many: build-out of the concession Kiosk, organization of concession activities, design and build-out of the 120V AC

Without controlling for the market structure in the first column, we find that not-for-profit hospitals provide similar health care to heart attack patients as government

Of these, six conclude that there is an increased risk of infection in workers that collect house- hold waste when compared to those unexposed to waste, three point to greater