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:  
Constant-Round Leakage-Resilient Zero-Knowledge from Collision Resistance
Springer Science and Business Media LLC - Tập 35 - Trang 1-41 - 2022
Susumu Kiyoshima
In this paper, we present a constant-round leakage-resilient zero-knowledge argument system for $$\mathcal {NP}$$ under the assumption of the existence of collision-resistant hash function families. That is, using a collision-resistant hash function, we construct a constant-round zero-knowledge ar...... hiện toàn bộ
Multiple assignment scheme for sharing secret
Springer Science and Business Media LLC - - 1993
Mitsuru Ito, Akira Saito, Takao Nishizeki
Toward Non-interactive Zero-Knowledge Proofs for NP from LWE
Springer Science and Business Media LLC - Tập 34 - Trang 1-35 - 2021
Ron D. Rothblum, Adam Sealfon, Katerina Sotiraki
Non-interactive zero-knowledge ( $$\mathsf {NIZK}$$ ) is a fundamental primitive that is widely used in the construction of cryptographic schemes and protocols. Our main result is a reduction from constructing $$\mathsf {NIZK}$$ ...... hiện toàn bộ
Side-Channel Resistant Crypto for Less than 2,300 GE
Springer Science and Business Media LLC - Tập 24 - Trang 322-345 - 2010
Axel Poschmann, Amir Moradi, Khoongming Khoo, Chu-Wee Lim, Huaxiong Wang, San Ling
A provably secure countermeasure against first order side-channel attacks was proposed by Nikova et al. (P. Ning, S. Qing, N. Li (eds.) International conference in information and communications security. Lecture notes in computer science, vol. 4307, pp. 529–545, Springer, Berlin, 2006). We have implemented the lightweight block cipher PRESENT using the proposed countermeasure. For this purpose we...... hiện toàn bộ
Cascade ciphers: The importance of being first
Springer Science and Business Media LLC - Tập 6 - Trang 55-61 - 1993
Ueli M. Maurer, James L. Massey
The security of cascade ciphers, in which by definition the keys of the component ciphers are independent, is considered. It is shown by a counterexample that the intuitive result, formally stated and proved in the literature, that a cascade is at least as strong as the strongest component cipher, requires the uninterestingly restrictive assumption that the enemy cannot exploit information about t...... hiện toàn bộ
A Forward-Secure Public-Key Encryption Scheme
Springer Science and Business Media LLC - Tập 20 - Trang 265-294 - 2007
Ran Canetti, Shai Halevi, Jonathan Katz
Cryptographic computations are often carried out on insecure devices for which the threat of key exposure represents a serious concern. Forward security allows one to mitigate the damage caused by exposure of secret keys. In a forward-secure scheme, secret keys are updated at regular periods of time; exposure of the secret key corresponding to a given time period does not enable an adversary to "b...... hiện toàn bộ
Identification Protocols and Signature Schemes Based on Supersingular Isogeny Problems
Springer Science and Business Media LLC - Tập 33 - Trang 130-175 - 2019
Steven D. Galbraith, Christophe Petit, Javier Silva
We present signature schemes whose security relies on computational assumptions relating to isogeny graphs of supersingular elliptic curves. We give two schemes, both of them based on interactive identification protocols. The first identification protocol is due to De Feo, Jao and Plût. The second one, and the main contribution of the paper, makes novel use of an algorithm of Kohel, Lauter, Petit ...... hiện toàn bộ
Structure-Preserving Signatures and Commitments to Group Elements
Springer Science and Business Media LLC - Tập 29 - Trang 363-421 - 2015
Masayuki Abe, Georg Fuchsbauer, Jens Groth, Kristiyan Haralambiev, Miyako Ohkubo
A modular approach to constructing cryptographic protocols leads to simple designs but often inefficient instantiations. On the other hand, ad hoc constructions may yield efficient protocols at the cost of losing conceptual simplicity. We suggest a new design paradigm, structure-preserving cryptography, that provides a way to construct modular protocols with reasonable efficiency while retaining c...... hiện toàn bộ
Dynamic Proofs of Retrievability Via Oblivious RAM
Springer Science and Business Media LLC - Tập 30 - Trang 22-57 - 2015
David Cash, Alptekin Küpçü, Daniel Wichs
Proofs of retrievability allow a client to store her data on a remote server (e.g., “in the cloud”) and periodically execute an efficient audit protocol to check that all of the data are being maintained correctly and can be recovered from the server. For efficiency, the computation and communication of the server and client during an audit protocol should be significantly smaller than reading/tra...... hiện toàn bộ
Generating Random Factored Numbers, Easily
Springer Science and Business Media LLC - Tập 16 - Trang 287-289 - 2003
Adam Kalai
Tổng số: 549   
  • 1
  • 2
  • 3
  • 4
  • 5
  • 6
  • 10