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ộ
Cách Đạt Được Mô Phỏng Hoàn Hảo và Một Vấn Đề Hoàn Chỉnh cho Chứng Minh Không Tương Tác Hoàn Hảo Dịch bởi AI
Springer Science and Business Media LLC - Tập 28 - Trang 533-550 - 2013
Lior Malka
Bài báo này nghiên cứu về chứng minh không biết hoàn hảo. Những chứng minh này không cho phép bất kỳ lỗi mô phỏng nào, và do đó các kỹ thuật từ việc nghiên cứu chứng minh không biết thống kê (nơi cho phép một lỗi nhỏ) không áp dụng được cho chúng. Chúng tôi giới thiệu một kỹ thuật dịch lỗi mới để xây dựng các mô phỏng hoàn hảo. Sử dụng kỹ thuật này, chúng tôi đưa ra vấn đề hoàn chỉnh đầu tiên cho ...... 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ộ
Efficient Non-malleable Commitment Schemes
Springer Science and Business Media LLC - Tập 22 - Trang 530-571 - 2009
Marc Fischlin, Roger Fischlin
Non-malleability protects against man-in-the middle attacks on cryptographic protocols. Non-malleable commitment schemes, for example, assure that a commitment of a message does not help to produce a commitment of a related message. Here we present efficient constructions of such commitment schemes in the common reference string model, based on standard assumptions such as RSA, factoring or discre...... hiện toàn bộ
Cryptographic Hash Functions from Expander Graphs
Springer Science and Business Media LLC - - 2009
Denis Charles, Kristin Lauter, Eyal Z. Goren
Algebraic properties of cryptosystem PGM
Springer Science and Business Media LLC - Tập 5 Số 3 - Trang 167-183 - 1992
Spyros S. Magliveras, Nasir Memon
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 Analysis of Cryptographic Assumptions in the Generic Ring Model
Springer Science and Business Media LLC - Tập 26 - Trang 225-245 - 2012
Tibor Jager, Jörg Schwenk
The generic ring model considers algorithms that operate on elements of an algebraic ring by performing only the ring operations and without exploiting properties of a given representation of ring elements. It is used to analyze the hardness of computational problems defined over rings. For instance, it is known that breaking RSA is equivalent to factoring in the generic ring model (Aggarwal and M...... 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
Tổng số: 549   
  • 1
  • 2
  • 3
  • 4
  • 5
  • 6
  • 10