形状
发表于 2025-3-30 11:37:59
https://doi.org/10.1007/978-3-319-13446-8d with these protocols is whether they can be executed in parallel. A positive answer was claimed by Fortnow, Rompel and Sipser, but its proof was later shown to be flawed by Fortnow who demonstrated that the probability of cheating in . independent parallel rounds can be exponentially higher than t
他姓手中拿着
发表于 2025-3-30 15:01:30
http://reply.papertrans.cn/15/1477/147607/147607_52.png
notification
发表于 2025-3-30 18:01:11
https://doi.org/10.1007/978-3-319-13446-8rting functions and/or permutations. In particular, we show that if a function has a . or a . of communication complexity bounded by ., then there is a circuit of size .(2..) which computes an inverse of the function. Consequently, we have proved, although inverting .. Boolean circuits is .-complete
圆桶
发表于 2025-3-30 21:41:38
Carl Hundhausen als PR-Praktiker,le relative to which secret agreement is possible, but relative to which trapdoor functions do not exist. Thus, . the case of private cryptosystems, there is no black box reduction from a k-pass system to a k-1 pass system. Our construction is natural— suggesting that real-world protocols could trad
摆动
发表于 2025-3-31 02:03:41
https://doi.org/10.1007/3-540-46766-1Informationstheorie; Komplexitätstheorie; Kryptologie; System Security; authentication; coding theory; com
unstable-angina
发表于 2025-3-31 05:29:42
978-3-540-55188-1Springer-Verlag Berlin Heidelberg 1992
愉快吗
发表于 2025-3-31 10:45:53
https://doi.org/10.1007/978-3-322-93040-8This paper shows how to derive a representation of the participants’ knowledge in a cryptographic protocol. The modelization is based on the assumption that the underlying cryptographic system is perfect and is an extension of the “Hidden Automorphism Model” introduced by Merritt. It can be used to establish the security of the protocols.
modest
发表于 2025-3-31 16:20:40
https://doi.org/10.1007/978-3-319-03671-7In this paper, we prove two new combinatorial characterizations of authentication codes. Authentication codes without secrecy are characterized in terms of orthogonal arrays; and general authentication codes are characterized in terms of balanced incomplete block designs.
LEER
发表于 2025-3-31 17:29:58
http://reply.papertrans.cn/15/1477/147607/147607_59.png
可以任性
发表于 2025-4-1 00:27:18
Advances in Cryptology — CRYPTO ’91978-3-540-46766-3Series ISSN 0302-9743 Series E-ISSN 1611-3349