Secure and trusted partial grey-box verification

No abstract is available for this paper.

• Publication year

  2019

• Venue

  International Journal of Information Security

• Publication date

  2019-03-27

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1007/s10207-019-00431-4
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Introduction to Modern Cryptography

  2020cited by this paper
• A Survey on Homomorphic Encryption Schemes

  2017cited by this paper
• Introduction to Modern Cryptography, Second Edition

  2014cited by this paper
• Pinocchio: Nearly Practical Verifiable Computation

  2013cited by this paper
• A Hybrid Architecture for Interactive Verifiable Computation

  2013cited by this paper
• SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge

  2013cited by this paper
• Reusable garbled circuits and succinct functional encryption

  2013influential reference
• Verifiable Computation with Massively Parallel Interactive Proofs

  2012cited by this paper
• Taking Proof-Based Verified Computation a Few Steps Closer to Practicality

  2012cited by this paper
• Making argument systems for outsourced computation practical (sometimes)

  2012cited by this paper
• Computing Blindfolded: New Developments in Fully Homomorphic Encryption

  2011cited by this paper
• Practical verified computation with streaming interactive proofs

  2011cited by this paper
• Faster Secure Two-Party Computation Using Garbled Circuits

  2011cited by this paper
• i-Hop Homomorphic Encryption and Rerandomizable Yao Circuits

  2010cited by this paper
• K-isomorphism: privacy preserving network publication against structural attacks

  2010cited by this paper
• Tabular Expressions in Software Engineering

  2009cited by this paper
• Fully homomorphic encryption using ideal lattices

  2009cited by this paper
• A fully homomorphic encryption scheme

  2009cited by this paper
• Preserving Privacy in Social Networks Against Neighborhood Attacks

  2008cited by this paper
• One-Time Programs

  2008cited by this paper
• Verification across Intellectual Property Boundaries

  2007cited by this paper
• Tabular Expressions and Their Relational Semantics

  2005cited by this paper
• Positive Results and Techniques for Obfuscation

  2004cited by this paper
• Fairplay - Secure Two-Party Computation System

  2004cited by this paper
• On the (im)possibility of obfuscating programs

  2001cited by this paper
• A Practical Tutorial on Modified Condition/Decision Coverage

  2001influential reference
• Software Tamper Resistance: Obstructing Static Analysis of Programs

  2000cited by this paper
• Non-interactive cryptocomputing for NC/sup 1/

  1999cited by this paper
• Non-Interactive CryptoComputing For NC1

  1999cited by this paper
• Probabilistic checking of proofs: a new characterization of NP

  1998cited by this paper
• A Taxonomy of Obfuscating Transformations

  1997cited by this paper
• Software Requirements for the A-7E Aircraft.

  1992cited by this paper
• Bit commitment using pseudorandomness

  1989influential reference
• Data Encryption Standard

  1988cited by this paper
• Protocols for secure computations

  1982cited by this paper
• Universal circuits (Preliminary Report)

  1976cited by this paper

• Learning environments in software testing education: An overview

  2023cites this paper