Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

33 relations
Coding theoryComputational Diffie–Hellman assumptionComputational complexity theoryCryptographic primitive

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
This present paper displays the sensitivity study of the hardness profile of flat cylinders heated by induction-heating process… 
2010
2010
Vulnerabilities of Wireless Key Exchange Based on Channel Reciprocity
Wireless key exchange on the physical layer is a key exchange protocol independent of computational assumptions. It relies only… 
2010
2010
Unconditionally Secure First-Price Auction Protocols Using a Multicomponent Commitment Scheme
Due to the rapid growth of e-commerce technology, secure auction protocols have attracted much attention among researchers. The… 
2009
2009
Properties of Rice Cakes for Topokki with Curry Powder
The principal objective of this study was to assess the quality characteristics of Topokki with different amounts of curry powder… 
2008
2008
XMM-Newton and Chandra observations of the globular cluster NGC 6388
Context. By studying the optical brightness surface density of the globular cluster NGC 6388, it has been recently proposed that… 
2007
2007
Temporal Networks with Alternatives: Complexity and Model
Temporal Networks play an important role in solving planning problems and they are also used, though not as frequently, when… 
2006
2006
A Computational Model for Watermark Robustness
Multimedia security schemes often combine cryptographic schemes with information hiding techniques such as steganography or… 
2004
2004
Ultra-thin tetrahedral amorphous carbon films with strong adhesion, as measured by nanoscratch testing
1994
1994
Non-aqueous gel permeation chromatography of wheat starch in dimethylacetamide (DMAC) and LiCl: extrusion-induced fragmentation
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
We are engaged in a program intended to establish relationships between the microscopic structure of highly cross-linked organic… 
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)