[图书][B] Cryptography: theory and practice
DR Stinson - 2005 - api.taylorfrancis.com
THE LEGACYFirst introduced in 1995, Cryptography: Theory and Practice garnered
enormous praise and popularity, and soon became the standard textbook for cryptography …
enormous praise and popularity, and soon became the standard textbook for cryptography …
Coding constructions for blacklisting problems without computational assumptions
We consider the broadcast exclusion problem: how to transmit a message over a broadcast
channel shared by N= 2 n users so that all but some specified coalition of k excluded users …
channel shared by N= 2 n users so that all but some specified coalition of k excluded users …
Cryptography with weights: MPC, encryption and signatures
The security of many powerful cryptographic systems such as secure multiparty computation,
threshold encryption, and threshold signatures rests on trust assumptions about the parties …
threshold encryption, and threshold signatures rests on trust assumptions about the parties …
Efficient methods for integrating traceability and broadcast encryption
In many applications for content distribution, broadcast channels are used to transmit
information from a distribution center to a large set of users. Broadcast encryption schemes …
information from a distribution center to a large set of users. Broadcast encryption schemes …
Design of self-healing key distribution schemes
A self-healing key distribution scheme enables dynamic groups of users of an unreliable
network to establish group keys for secure communication. In such a scheme, a group …
network to establish group keys for secure communication. In such a scheme, a group …
Evolving ramp secret-sharing schemes
A Beimel, H Othman - Security and Cryptography for Networks: 11th …, 2018 - Springer
Evolving secret-sharing schemes, introduced by Komargodski, Naor, and Yogev (TCC
2016b), are secret-sharing schemes in which the dealer does not know the number of …
2016b), are secret-sharing schemes in which the dealer does not know the number of …
Bounds and techniques for efficient redistribution of secret shares to new access structures
We consider the problem of redistributing shares in a secret sharing scheme in such a way
that shareholders of a scheme with one access structure can transfer information to a new …
that shareholders of a scheme with one access structure can transfer information to a new …
Evolving ramp secret sharing with a small gap
A Beimel, H Othman - Annual International Conference on the Theory and …, 2020 - Springer
Evolving secret-sharing schemes, introduced by Komargodski, Naor, and Yogev (TCC
2016b), are secret-sharing schemes in which there is no a-priory upper bound on the …
2016b), are secret-sharing schemes in which there is no a-priory upper bound on the …
Threshold secret sharing requires a linear size alphabet
We prove that for every n and 1< t< n 1< t< n any t-out-of-n threshold secret sharing scheme
for one-bit secrets requires share size\log (t+ 1) log (t+ 1). Our bound is tight when t= n-1 t= n …
for one-bit secrets requires share size\log (t+ 1) log (t+ 1). Our bound is tight when t= n-1 t= n …
Mingyuan Wang5, and Yinuo Zhang5 1 ¹ UC Berkeley and NTT Research, Berkeley, USA sanjamg@ berkeley. edu 2 John Hopkins University, Baltimore, USA
S Garg¹, A Jain, P Mukherjee… - Advances in Cryptology …, 2023 - books.google.com
The security of many powerful cryptographic systems such as secure multiparty computation,
threshold encryption, and threshold signatures rests on trust assumptions about the parties …
threshold encryption, and threshold signatures rests on trust assumptions about the parties …