The following pages link to Keith M. Martin (Q68593):
Displaying 50 items.
- Michelle Kendall (Q68595) (← links)
- (Q306045) (redirect page) (← links)
- Graph-theoretic design and analysis of key predistribution schemes (Q306046) (← links)
- Localised multisecret sharing (Q520075) (← links)
- Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures (Q662167) (← links)
- Perfect secret sharing schemes on five participants (Q676919) (← links)
- A construction for multisecret threshold schemes (Q676920) (← links)
- A general decomposition construction for incomplete secret sharing schemes (Q1281416) (← links)
- Geometric secret sharing schemes and their duals (Q1321560) (← links)
- Mutually trusted authority-free secret sharing schemes (Q1382145) (← links)
- Providing anonymity in unconditionally secure secret sharing schemes (Q1395762) (← links)
- Geometrical contributions to secret sharing theory (Q1879097) (← links)
- Efficient, XOR-based, ideal \((t,n)\)-threshold schemes (Q1989458) (← links)
- Strong post-compromise secure proxy re-encryption (Q2183914) (← links)
- A general approach to robust web metering (Q2486871) (← links)
- Ideal secret sharing schemes with multiple secrets (Q2563545) (← links)
- Distributing the encryption and decryption of a block cipher (Q2572965) (← links)
- (Q2757242) (← links)
- Extended Functionality in Verifiable Searchable Encryption (Q2802427) (← links)
- An application-oriented framework for wireless sensor network key establishment (Q2864366) (← links)
- On the Role of Expander Graphs in Key Predistribution Schemes for Wireless Sensor Networks (Q2920412) (← links)
- The Rise and Fall and Rise of Combinatorial Key Predistribution (Q3084246) (← links)
- A note on duality in linear secret sharing schemes (Q3126447) (← links)
- Optimal updating of ideal threshold schemes (Q3412134) (← links)
- Applications of Galois geometry to cryptology (Q3464681) (← links)
- Updating the Parameters of a Threshold Scheme by Minimal Broadcast (Q3546543) (← links)
- Resolvable designs applicable to cryptographic authentication schemes (Q4024337) (← links)
- An algorithm for efficient geometric secret sharing schemes (Q4228220) (← links)
- Combinatorial models for perfect secret sharing schemes (Q4239591) (← links)
- Changing thresholds in the absence of secure channels (Q4250638) (← links)
- (Q4269754) (← links)
- New secret sharing schemes from old (Q4288075) (← links)
- (Q4322858) (← links)
- Cumulative arrays and geometric secret sharing schemes (Q4341671) (← links)
- Multisecret threshold schemes (Q4341738) (← links)
- On sharing many secrets. (Extended abstract) (Q4341778) (← links)
- Secret sharing in hierarchical groups (Q4373614) (← links)
- (Q4373624) (← links)
- (Q4379737) (← links)
- Increasing efficiency of international key escrow in mutually mistrusting domains (Q4400584) (← links)
- Size of broadcast in threshold schemes with disenrollment (Q4412961) (← links)
- (Q4413328) (← links)
- The geometry of shared secret schemes (Q4853712) (← links)
- Bounds and Techniques for Efficient Redistribution of Secret Shares to New Access Structures (Q4950860) (← links)
- Revisiting and Extending the AONT-RS Scheme: A Robust Computationally Secure Secret Sharing Scheme (Q4975177) (← links)
- Some remarks on authentication systems (Q5202143) (← links)
- Everyday cryptography. Fundamental principles and applications. (Q5268510) (← links)
- Distinct Difference Configurations: Multihop Paths and Key Predistribution in Sensor Networks (Q5281354) (← links)
- Two-Dimensional Patterns With Distinct Differences—Constructions, Bounds, and Maximal Anticodes (Q5281579) (← links)
- A combinatorial interpretation of ramp schemes (Q5284641) (← links)
