Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,741,318 papers from all fields of science
Search
Sign In
Create Free Account
Computational hardness assumption
Known as:
Computational hardness assumptions
, Computational security
In cryptography, a major goal is to create cryptographic primitives with provable security. In some cases, cryptographic protocols are found to have…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
33 relations
Coding theory
Computational Diffie–Hellman assumption
Computational complexity theory
Cryptographic primitive
Expand
Broader (1)
Computational number theory
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Sensitivity study of hardness profile of 4340 specimen heated by induction process using axisymmetric modeling
N. Barka
,
P. Bocher
,
J. Brousseau
2013
Corpus ID: 111308353
This present paper displays the sensitivity study of the hardness profile of flat cylinders heated by induction-heating process…
Expand
2010
2010
Vulnerabilities of Wireless Key Exchange Based on Channel Reciprocity
Nico Döttling
,
Dejan E. Lazich
,
J. Müller-Quade
,
Antonio Sobreira de Almeida
Web Information System and Application Conference
2010
Corpus ID: 42735364
Wireless key exchange on the physical layer is a key exchange protocol independent of computational assumptions. It relies only…
Expand
2010
2010
Unconditionally Secure First-Price Auction Protocols Using a Multicomponent Commitment Scheme
Mehrdad Nojoumian
,
Douglas R Stinson
International Conference on Information…
2010
Corpus ID: 14204159
Due to the rapid growth of e-commerce technology, secure auction protocols have attracted much attention among researchers. The…
Expand
2009
2009
Properties of Rice Cakes for Topokki with Curry Powder
Jang-Woo Ahn
2009
Corpus ID: 54697286
The principal objective of this study was to assess the quality characteristics of Topokki with different amounts of curry powder…
Expand
2008
2008
XMM-Newton and Chandra observations of the globular cluster NGC 6388
A. Nucita
,
F. Paolis
,
G. Ingrosso
,
S. Carpano
,
M. Guainazzi
2008
Corpus ID: 54729682
Context. By studying the optical brightness surface density of the globular cluster NGC 6388, it has been recently proposed that…
Expand
2007
2007
Temporal Networks with Alternatives: Complexity and Model
R. Barták
,
O. Čepek
The Florida AI Research Society
2007
Corpus ID: 2263320
Temporal Networks play an important role in solving planning problems and they are also used, though not as frequently, when…
Expand
2006
2006
A Computational Model for Watermark Robustness
André Adelsbach
,
S. Katzenbeisser
,
A. Sadeghi
Information Hiding
2006
Corpus ID: 14748068
Multimedia security schemes often combine cryptographic schemes with information hiding techniques such as steganography or…
Expand
2004
2004
Ultra-thin tetrahedral amorphous carbon films with strong adhesion, as measured by nanoscratch testing
J. Quinn
,
P. Lemoine
,
P. Maguire
,
J. McLaughlin
2004
Corpus ID: 11935166
1994
1994
Non-aqueous gel permeation chromatography of wheat starch in dimethylacetamide (DMAC) and LiCl: extrusion-induced fragmentation
M. L. Politz
,
J. Timpa
,
Alan R. White
,
B. P. Wasserman
1994
Corpus ID: 36297731
Review
1988
Review
1988
Hypercross-Linked Organic Solids: Preparation from Poly(aromatic diacetylenes) and Preliminary Measurements of their Young's Modulus, Hardness, and Thermal Stability
T. Neenan
,
M. Callstrom
,
L. M. Scarmoutzos
,
K. Stewart
,
G. Whitesides
,
V. R. Howes
1988
Corpus ID: 50114031
We are engaged in a program intended to establish relationships between the microscopic structure of highly cross-linked organic…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE
or Only Accept Required