Disclaimer:
Educational Use Only:
The website links provided are to be used strictly for educational and knowledge-gaining purposes only.
No Misuse:
Do not misuse the links or the information contained therein for any commercial, illegal, or unethical activities.
Respect for Websites and Businesses:
Respect the intellectual property and business interests of the websites and their owners. Do not attempt to alter, copy, or redistribute content without proper authorization.
Acknowledge Value of Knowledge:
Recognize and value the knowledge and resources shared by these websites. Use the information responsibly and ethically.
No Endorsement:
The provision of these links does not imply endorsement of the linked sites, their content, or their products and services. Users are responsible for evaluating the suitability and accuracy of the information.
User Responsibility:
By accessing these links, you agree to use the information at your own risk and to comply with all applicable laws and website terms of use.
- In the context of cloud computing, a compute constraint refers to:
a. limits on data encryption algorithms
b. restrictions on CPU, memory, or processing capacity available for workloads
c. limitations on network throughput
d. constraints on user authentication methods
Answer: b (Compute constraints pertain to CPU, memory, or processing capacity in cloud / compute environments.) - What is the main security risk arising from timing side channels under shared compute resources?
a. Denial-of-service by CPU exhaustion
b. Leakage of secret data via timing variation
c. Data corruption due to race conditions
d. Unauthorized user login
Answer: b (Timing side channels can leak secret information via observation of timing variations in shared compute environments) (arXiv) - Which mechanism is proposed to eliminate timing channels in cloud systems by preventing execution timing from affecting output?
a. Resource partitioning
b. Virtualization
c. Deterministic execution enforced by provider
d. Homomorphic encryption
Answer: c (Provider-enforced deterministic execution prevents timing variation from leaking information) (arXiv) - In modeling an attacker in a cyber-physical system, a resource constraint means:
a. The attacker must pay licensing fees
b. The attacker’s total consumable power or resources (e.g. energy, actuators) is bounded
c. The attacker cannot cross administrative boundaries
d. The attacker has only network access
Answer: b (Resource constraint refers to bounded consumable resource the attacker can use) (ieee-jas.net) - In policy enforcement (e.g. in security tools), a policy constraint is:
a. A condition to generate audit logs
b. A restriction that defines when a policy is violated
c. A hardware mechanism to block execution
d. A user interface rule
Answer: b (Policy constraints define violating conditions during policy evaluation) (help.sonatype.com) - Confidential computing addresses compute constraints by:
a. encrypting data in transit only
b. protecting data in use inside trusted execution environments (TEEs)
c. disabling CPU throttling
d. compressing memory usage
Answer: b (Confidential computing protects data in use via TEEs) (Wikipedia) - A compute constraint in an embedded security system is most likely to affect:
a. user training
b. cryptographic algorithm choice
c. policy drafting
d. role assignments
Answer: b (In constrained devices, cryptographic algorithm choice is constrained by compute resources) - If a system must satisfy security constraints under restricted compute conditions, one must trade off among:
a. storage, network, and cryptography
b. availability, confidentiality, and integrity
c. quality, budget, and resources
d. scalability, usability, and performance
Answer: c (In cybersecurity constraints, the three constraints are often quality, budget, and resources) (Kyber Secure) - When designing a secure system under compute constraints, which of these is most crucial?
a. maximize UI features
b. minimize algorithmic complexity
c. ignore side channels
d. use unbounded randomness
Answer: b (Minimizing algorithmic complexity helps reduce compute load under constrained environments) - In side-channel attacks on shared compute, which resource is commonly exploited?
a. Disk I/O
b. Random number generator
c. Cache or CPU timing
d. Graphics card
Answer: c (Cache and CPU timing are often exploited in side-channel attacks) - Which security property is made harder to enforce under compute constraints?
a. Integrity
b. Confidentiality
c. Availability
d. All of the above
Answer: d (All main security properties may be harder under compute constraints) - A deterministic execution system in the cloud aims to nullify:
a. Denial-of-service attacks
b. Timing side channels
c. Fault injection
d. Insider threats
Answer: b (Deterministic execution is proposed to eliminate timing side channels) (arXiv) - In constrained cybersecurity (embedded, IoT), one common mitigation is to use lightweight cryptography because:
a. It uses more memory
b. It is industry standard
c. It uses fewer compute cycles
d. It’s deprecated
Answer: c (Lightweight cryptography uses fewer compute cycles, suitable for constrained devices) - In modeling attacker resource constraints, the verification problem is:
a. NP-hard
b. always trivial
c. polynomial time
d. undecidable
Answer: c (In one attack synthesis under resource constraints, the verification method is polynomial time) (ieee-jas.net) - Which of the following is not a typical compute constraint in cybersecurity?
a. limited CPU cycles
b. memory constraints
c. network protocol limits
d. power consumption limit
Answer: c (Network protocol limits are communication constraints, not compute constraints) - In cloud multi-tenant systems, compute constraints may lead to noisy neighbor effects, which can cause:
a. confidentiality breaches
b. increased cryptographic strength
c. unlimited CPU access
d. deterministic behavior
Answer: a (Noisy neighbor effects can lead to side channels or performance interference affecting confidentiality) - In a TEE, compute constraints influence how large the trusted computing base (TCB) can be. If compute is tight, the TCB must be:
a. larger
b. modular only
c. minimal
d. redundant
Answer: c (Under tight compute constraints, the TCB must be minimal to reduce overhead) - Which of the following is a technique to manage compute constraints while preserving security?
a. full-blown SSL for all modules
b. adaptive cryptographic modes
c. always using RSA-4096
d. disabling checks
Answer: b (Adaptive cryptographic modes may adjust strength according to resource availability) - The difference between a security objective and a security constraint is:
a. Objective is optional; constraint is mandatory
b. Constraint is what must hold under operation; objective is what should be achieved
c. They are identical
d. Objective is the design goal; constraint is the implementation boundary
Answer: d (Objective is goal, constraint is boundary) (support.kaspersky.ru) - In a system under compute constraints, static analysis (versus runtime checks) is preferred because:
a. static analysis is slower
b. runtime checks consume compute
c. static analysis is less secure
d. runtime checks are free
Answer: b (Runtime checks cost compute, so static analysis is preferred under constraints) - Which compute constraint is most relevant for battery-powered IoT devices?
a. memory
b. power consumption
c. network latency
d. user access
Answer: b (Power consumption is a critical compute constraint in battery-powered devices) - A covert attack subject to resource constraints must optimize resource usage to remain:
a. visible
b. deterministic
c. covert
d. inefficient
Answer: c (Under resource constraints, a covert attacker must optimize to remain covert) - In cloud computing, enforcing deterministic execution may degrade:
a. security
b. parallel performance
c. memory safety
d. encryption strength
Answer: b (Determinism constraints often reduce parallel performance) (arXiv) - When compute is constrained, one may prefer symmetric over asymmetric cryptography because:
a. symmetric is slower
b. symmetric uses fewer cycles
c. asymmetric is less secure
d. symmetric uses more memory
Answer: b (Symmetric cryptography typically uses fewer computation cycles than asymmetric) - In cloud threat models, compute constraints can force the use of side-channel resistant mechanisms such as:
a. conditional branching
b. data-dependent loops
c. constant-time operations
d. dynamic memory calls
Answer: c (Constant-time operations help resist side channels) - The unattainable triangle in cybersecurity constraints refers to tradeoffs among:
a. speed, redundancy, and cost
b. budget, resources, and quality
c. availability, integrity, and confidentiality
d. access, logging, and encryption
Answer: b (The unattainable triangle refers to quality, budget, and resources) (Kyber Secure) - In attacker synthesis under resource constraints, one must consider:
a. only CPU budget
b. memory and energy budget
c. network bandwidth alone
d. user consent
Answer: b (Attacker synthesis models consider memory, energy, CPU budgets) - For a shared compute environment, what constraint helps reduce side channels while allowing efficient resource use?
a. disable caching
b. resource partitioning
c. unlimited shared caches
d. random execution timings
Answer: b (Resource partitioning helps reduce leakage by isolating resources) - Compute constraints can affect the granularity of security checks: if constraints are tight, checks tend to be:
a. very fine-grained
b. coarse or aggregated
c. continuous
d. redundant
Answer: b (Under tight compute, checks often aggregately or coarsely applied to reduce overhead) - In a cloud provider’s enforcement of deterministic execution, what is the impact on statistical sharing efficiency?
a. increases
b. unaffected
c. decreases
d. becomes infinite
Answer: c (Statistical sharing efficiency decreases) (arXiv) - In compute-constrained systems, side channels pose special threat because:
a. they always require heavy computation
b. they can leak without modifying state
c. they require user input
d. they are slow
Answer: b (Side channels exploit non-functional side effects without state changes) - Which of these is not a countermeasure to manage compute constraints in security?
a. hardware acceleration (e.g. crypto co-processors)
b. selective feature disabling
c. infinite key lengths
d. lightweight protocols
Answer: c (Infinite key lengths worsen compute constraints) - In cloud multi-tenant systems, compute constraints may help in covert sensor attacks by attacker with limited budget in CPS: the attacker must allocate limited resource consumption across:
a. reading only
b. modifying actuators only
c. both sensor and actuator attacks
d. infrastructure sabotage
Answer: c (Attacker may allocate budget across sensor and actuator attacks) (ieee-jas.net) - The complexity of verifying constraints under attacker resource limits typically scales with:
a. linear time
b. polynomial time
c. exponential time
d. constant time
Answer: b (In selected models, verification can be polynomial time) (ieee-jas.net) - In compute-constrained environments, to ensure data integrity, one may use:
a. full digital signatures everywhere
b. MACs (message authentication codes)
c. no integrity checks
d. redundant file copies
Answer: b (MACs are lighter than full signatures, suitable under constraints) - A compute constraint might force cipher reuse or session key reuse, which is dangerous because:
a. it speeds up encryption
b. it weakens security by lowering unpredictability
c. it uses more memory
d. it increases network traffic
Answer: b (Key reuse reduces randomness, weakening security) - When designing a system with compute constraints, one must often prune attack surfaces, meaning:
a. reduce features or exposed interfaces
b. open more ports
c. increase UI complexity
d. disable logging
Answer: a (Reducing features / interfaces reduces attack surface, helpful under compute constraints) - Compute constraints may push adaptive systems to prefer failure-safe defaults, since:
a. safer choices are cheaper
b. unsafe defaults cost less
c. default settings never matter
d. adaptive switching is free
Answer: a (Prefer safer defaults when dynamic checks are expensive) - In modeling string processing security (e.g. input filters) under constraints, one uses string constraint solving to verify security properties. Which is true?
a. string constraint solving is trivial
b. string constraint solving is only theoretical
c. string constraint solving is actively researched and applied in security analysis
d. string constraint solving is deprecated
Answer: c (String constraint solving is a mature domain used in security) (arXiv) - In a CSP (constraint satisfaction problem) model of security under compute limits, variables represent:
a. only users
b. resources, actions, states
c. physical ports
d. network packets
Answer: b (In CSP, variables can represent resource allocations, actions, states) (Wikipedia) - The cost of constant-time implementation (to prevent timing side channels) is typically:
a. zero overhead
b. some performance penalty
c. infinite overhead
d. benefit in speed
Answer: b (Constant-time implementations incur performance penalty) - In constrained systems, dynamic key refresh frequency might be lowered to save compute, but that risks:
a. network congestion
b. increased key compromise window
c. power savings
d. no effect
Answer: b (Less frequent refresh increases exposure window) - Which of these helps mitigate compute constraint while preserving security in cloud workloads?
a. unlimited autoscaling
b. hardware enclaves (TEE) offloading
c. disable encryption
d. heavy caching of keys
Answer: b (Hardware enclaves offload secure computation) - In attacker synthesis, a combined-attack model with resource constraints is used to analyze attacker’s ability to reach unsafe states. This is known as:
a. unbounded synthesis
b. combined-attackability
c. static permission analysis
d. functional decomposition
Answer: b (The notion of combined-attackability is introduced under resource constraints) (ieee-jas.net) - Compute constraints can force compromises in logging detail. However, reduce logging detail may reduce the ability to detect:
a. trivial events
b. forensic evidence
c. encryption speed
d. user activity
Answer: b (Less detailed logging reduces forensic value) - When compute constrained, one may offload cryptographic tasks to secure hardware modules (HSMs) because:
a. they are slower
b. they consume host CPU
c. they provide isolated compute
d. they reduce security
Answer: c (HSMs provide isolated compute offload) - A sanitization filter under compute constraint may use simpler patterns rather than full context parsing. The risk is increased:
a. performance
b. false negatives/positives
c. energy usage
d. availability
Answer: b (Simpler filters may misclassify inputs) - A compute-constrained system may use probabilistic checks (sampling) rather than full checking. That approach trades guarantee for:
a. absolute security
b. performance and resource savings
c. no risk
d. infinite cost
Answer: b (Probabilistic checks reduce resource usage at cost of lower guarantees) - In a cloud computing threat model, compute constraints may push one to use verifiable computing or proofs (e.g. SNARKs), but drawback is:
a. they cost no compute
b. proof generation is expensive
c. they are insecure
d. they break confidentiality
Answer: b (Proof generation is computationally heavy; thus constrained) - In summary, the main challenge with compute constraints in cybersecurity is:
a. there is always infinite compute
b. balancing security strength vs resource consumption under limiting hardware
c. compute constraints never matter
d. network issues are bigger
Answer: b (Key challenge is to balance security strength with limited compute resources)
