Springer Science and Business Media LLC

Công bố khoa học tiêu biểu

* Dữ liệu chỉ mang tính chất tham khảo

Sắp xếp:  
More Constructions of Lossy and Correlation-Secure Trapdoor Functions
Springer Science and Business Media LLC - Tập 26 - Trang 39-74 - 2011
David Mandell Freeman, Oded Goldreich, Eike Kiltz, Alon Rosen, Gil Segev
We propose new and improved instantiations of lossy trapdoor functions (Peikert and Waters in STOC’08, pp. 187–196, 2008), and correlation-secure trapdoor functions (Rosen and Segev in TCC’09, LNCS, vol. 5444, pp. 419–436, 2009). Our constructions widen the set of number-theoretic assumptions upon which these primitives can be based, and are summarized as follows: ...... hiện toàn bộ
Information Theoretical Cryptogenography
Springer Science and Business Media LLC - Tập 30 - Trang 1067-1115 - 2016
Sune K. Jakobsen
We consider problems where n people are communicating and a random subset of them is trying to leak information, without making it clear who are leaking the information. We introduce a measure of suspicion and show that the amount of leaked information will always be bounded by the expected increase in suspicion, and that this bound is tight. Suppose a large number of people have some information ...... hiện toàn bộ
Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors
Springer Science and Business Media LLC - Tập 36 - Trang 1-42 - 2023
Benoît Libert, San Ling, Khoa Nguyen, Huaxiong Wang
An accumulator is a function that hashes a set of inputs into a short, constant-size string while preserving the ability to efficiently prove the inclusion of a specific input element in the hashed set. It has proved useful in the design of numerous privacy-enhancing protocols, in order to handle revocation or simply prove set membership. In the lattice setting, currently known instantiations of t...... hiện toàn bộ
An implementation for a fast public-key cryptosystem
Springer Science and Business Media LLC - Tập 3 - Trang 63-79 - 1991
G. B. Agnew, R. C. Mullin, I. M. Onyszchuk, S. A. Vanstone
In this paper we examine the development of a high-speed implementation of a system to perform exponentiation in fields of the form GF(2 n ). For sufficiently large n, this device has applications in public-key cryptography. The selection of representation and observations on the structure of multiplication have led to the development of an architecture which is o...... hiện toàn bộ
Perfect Zero-Knowledge Arguments for NP Using Any One-Way Permutation
Springer Science and Business Media LLC - Tập 11 Số 2 - Trang 87-108 - 1998
Moni Naor, Rafail Ostrovsky, Ramarathnam Venkatesan, Moti Yung
Efficient cryptographic schemes provably as secure as subset sum
Springer Science and Business Media LLC - Tập 9 - Trang 199-216 - 1996
Russell Impagliazzo, Moni Naor
We show very efficient constructions for a pseudorandom generator and for a universal one-way hash function based on the intractability of the subset-sum problem for certain dimensions. (Pseudorandom generators can be used for private-key encryption and universal one-way hash functions for signature schemes.) The increase in efficiency in our construction is due to the fact that many bits can be g...... hiện toàn bộ
Ideal Multipartite Secret Sharing Schemes
Springer Science and Business Media LLC - Tập 25 - Trang 434-463 - 2011
Oriol Farràs, Jaume Martí-Farré, Carles Padró
Multipartite secret sharing schemes are those having a multipartite access structure, in which the set of participants is divided into several parts and all participants in the same part play an equivalent role. In this work, the characterization of ideal multipartite access structures is studied with all generality. Our results are based on the well-known connections between ideal secret sharing ...... hiện toàn bộ
On the (in)Security of ROS
Springer Science and Business Media LLC - Tập 35 - Trang 1-25 - 2022
Fabrice Benhamouda, Tancrède Lepoint, Julian Loss, Michele Orrù, Mariana Raykova
We present an algorithm solving the ROS (Random inhomogeneities in a Overdetermined Solvable system of linear equations) problem mod p in polynomial time for $$\ell > \log p$$ dimensions. Our algorithm can be combined with Wagner’s attack, and leads to a sub-exponential solution for any dimension ...... hiện toàn bộ
Known-IV, Known-in-Advance-IV, and Replayed-and-Known-IV Attacks on Multiple Modes of Operation of Block Ciphers
Springer Science and Business Media LLC - Tập 19 - Trang 441-462 - 2006
Deukjo Hong, Seokhie Hong, Wonil Lee, Sangjin Lee, Jongin Lim, Jaechul Sung, Okyeon Yi
Normally, it has been believed that the initial values of cryptographic schemes do not need to be managed secretly unlike the secret keys. However, we show that multiple modes of operation of block ciphers can suffer a loss of security by the state of the initial values. We consider several attacks according to the environment of the initial values; known-IV attack, known-in-advance-IV attack, and...... hiện toàn bộ
Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation
Springer Science and Business Media LLC - Tập 16 Số 3 - Trang 143-184 - 2003
Lindell,
In this paper we show that any two-party functionality can be securely computed in a constant number of rounds , where security is obtained against (polynomial-time) malicious adversaries that may arbitrarily deviate from the protocol specification. This is in contrast to Yao's constant-round protocol that ensures security only in the face of semi-honest adversaries, and to its malicious adversary...... hiện toàn bộ
Tổng số: 549   
  • 1
  • 2
  • 3
  • 4
  • 5
  • 6
  • 10