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ộ
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ộ
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ộ
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ộ
A One-Time Stegosystem and Applications to Efficient Covert Communication
Springer Science and Business Media LLC - Tập 27 - Trang 23-44 - 2012
Aggelos Kiayias, Yona Raekow, Alexander Russell, Narasimha Shashidhar
We present the first information-theoretic steganographic protocol with an asymptotically optimal ratio of key length to message length that operates on arbitrary covertext distributions with constant min-entropy. Our results are also applicable to the computational setting: our stegosystem can be composed over a pseudorandom generator to send longer messages in a computationally secure fashion. I...... hiện toàn bộ
Index Calculus in Class Groups of Non-hyperelliptic Curves of Genus Three
Springer Science and Business Media LLC - Tập 21 - Trang 593-611 - 2007
Claus Diem, Emmanuel Thomé
We study an index calculus algorithm to solve the discrete logarithm problem (DLP) in degree 0 class groups of non-hyperelliptic curves of genus 3 over finite fields. We present a heuristic analysis of the algorithm which indicates that the DLP in degree 0 class groups of non-hyperelliptic curves of genus 3 can be solved in an expected time of ...... hiện toàn bộ
A chosen message attack on Demytko’s elliptic curve cryptosystem
Springer Science and Business Media LLC - - 1997
Burt Kaliski
Improved Single-Key Attacks on 8-Round AES-192 and AES-256
Springer Science and Business Media LLC - Tập 28 Số 3 - Trang 397-422 - 2015
Orr Dunkelman, Nathan Keller, Adi Shamir
Correction to: Unconditionally Secure Computation Against Low-Complexity Leakage
Springer Science and Business Media LLC - Tập 35 - Trang 1-34 - 2022
Andrej Bogdanov, Yuval Ishai, Akshayaram Srinivasan
We consider the problem of constructing leakage-resilient circuit compilers that are secure against global leakage functions with bounded output length. By global, we mean that the leakage can depend on all circuit wires and output a low-complexity function (represented as a multi-output Boolean circuit) applied on these wires. In this work, we design compilers both in the stateless (a.k.a. single...... hiện toàn bộ
Tổng số: 549   
  • 1
  • 2
  • 3
  • 4
  • 5
  • 6
  • 10