Deleting Secret Data with Public Verifiability

Abstract

Existing software-based data erasure programs can be summarized as following the same one-bit-return protocol: the deletion program performs data erasure and returns either success or failure. However, such a one bit- return protocol turns the data deletion system into a black box – the user has to trust the outcome but cannot easily verify it. This is especially problematic when the deletion program is encapsulated within a Trusted Platform Module (TPM), and the user has no access to the code inside.In this paper, we present a cryptographic solution that aims to make the data deletion process more transparent and verifiable. In contrast to the conventional black/white assumptions about TPM (i.e., either completely trust or distrust), we introduce a third assumption that sits in between: namely, “trust-but-verify”. Our solution enables a user to verify the correct implementation of two important operations inside a TPM without accessing its source code: i.e., the correct encryption of data and the faithful deletion of the key. Finally, we present a proof-of-concept implementation of the SSE system on a resource-constrained Java card to demonstrate its practical feasibility. To our knowledge, this is the first systematic solution to the secure data deletion problem based on a “trust-but-verify” paradigm, together with a concrete prototype implementation.

Aim

The aim is to provide public verifiability for a secure data deletion system by adopting public key cryptography.

Scope

The scope is to present a concrete cryptographic solution, called Secure Storage and Erasure (SSE), which enables a user to verify the correct implementation of cryptographic operations inside a TPM without having to access its internal source code.

Existing system

Several Existing systems have recognized the importance of verifiability in the secure data deletion process which does not use any cryptography.

Disadvantages:

The deletion program performs data erasure and returns either success or failure. However, such a one bit- return protocol turns the data deletion system into a black box – the user has to trust the outcome but cannot easily verify it. This is especially problematic when the deletion program is encapsulated within a Trusted Platform Module (TPM), and the user has no access to the code inside.

Proposed system

In this paper, we present a cryptographic solution that aims to make the data deletion process more transparent and verifiable. In contrast to the conventional black/white assumptions about TPM (i.e., either completely trust or distrust), we introduce a third assumption that sits in between: namely, “trust-but-verify”. Our solution enables a user to verify the correct implementation of two important operations inside a TPM without accessing its source code: i.e., the correct encryption of data and the faithful deletion of the key. Finally, we present a proof-of-concept implementation of the SSE system on a resource-constrained Java card to demonstrate its practical feasibility.

Advantages

The main advantage is to enable a user to verify the correct implementation of two important operations inside a TPM without accessing its source code: i.e., the correct encryption of data and the faithful deletion of the key.

System architecture:

 

SYSTEM CONFIGURATION

HARDWARE REQUIREMENTS:-

·                Processor          -   Pentium –III

·                Speed                -    1.1 Ghz

·                RAM                 -    256 MB(min)

·                Hard Disk         -   20 GB

·                Floppy Drive    -    1.44 MB

·                Key Board         -    Standard Windows Keyboard

·                Mouse               -    Two or Three Button Mouse

·                Monitor             -    SVGA

SOFTWARE REQUIREMENTS:-

·                Operating System      : Windows  7                                       

·                Front End                  : JSP AND SERVLET

·                Database                  : MYSQL

·                Tool                           :NETBEANS

REFERENCE:

Hao, F.,Clarke, D. ; Zorzo, A. “DELETING SECRET DATA WITH PUBLIC VERIFIABILITY” Dependable and Secure Computing, IEEE Transactions on  (Volume:PP ,  Issue: 99 ) April 2015

Contributory Broadcast Encryption With Efficient Encryption And Short Cipher Texts

ABSTRACT

Traditional broadcast encryption (BE) schemes allow a sender to securely broadcast to any subset of members but require a trusted party to distribute decryption keys. Group key agreement (GKA) protocols enable a group of members to negotiate a common encryption key via open networks so that only the group members can decrypt the cipher texts encrypted under the shared encryption key, but a sender cannot exclude any particular member from decrypting the cipher texts. In this paper, we bridge these two notions with a hybrid primitive referred to as contributory broadcast encryption (ConBE). In this new primitive, a group of members negotiate a common public encryption key while each member holds a decryption key. A sender seeing the public group encryption key can limit the decryption to a subset of members of his choice. Following this model, we propose a ConBE scheme with short ciphertexts. The scheme is proven to be fully collusion-resistant under the decision n-Bilinear Diffie-Hellman Exponentiation (BDHE) assumption in the standard model. Of independent interest, we present a new BE scheme that is aggregatable. The aggregatability property is shown to be useful to construct advanced protocols.

AIM

The aim of this paper is a group of members negotiate a common public encryption key while each member holds a decryption key. A sender seeing the public group encryption key can limit the decryption to a subset of members of his choice.

SCOPE:

The Scope of this Paper  is proven to be fully collusion-resistant under the decision n-Bilinear Diffie-Hellman Exponentiation (BDHE) assumption in the standard model.

EXISTING SYSTEM

BE schemes in the literature can be classified into two categories, i.e., symmetric-key BE  and public-key BE . In the symmetric-key setting, only the trusted center generates all the secret keys and broadcasts messages to users. Hence, only the key generation center can be the broadcaster or the sender. Similarly to the GKA setting, tree-based key structures were independently proposed to improve efficiency in symmetric-key BE systems and further improved in with O(log n) keys. Cheon et al.presented an efficient symmetric BE scheme allowing new members to join the protocol anytime. Harn and Lin proposed a group key transfer protocol. Their protocol is based on secret sharing and is considerably efficient, albeit it cannot revoke (compromised) users

DISADVANTAGES

1. Group key agreement (GKA) protocols enable a group of members to negotiate a common encryption key via open networks so that only the group members can decrypt the cipher texts encrypted under the shared encryption key but a sender cannot exclude any particular member from decrypting the cipher texts.
2. A  BE system heavily relies on a fully trusted key server who generates secret decryption keys for the members and can read all the communications to any members.

PROPOSED SYSTEM

In this paper, construct an efficient ConBE scheme with our AggBE scheme as a building block. The ConBE construction is proven to be semi-adaptively secure under the decision BDHE assumption in the standard model. Only one round is required to establish the public group encryption key and set up the ConBE system. After the system set-up, the storage cost of both the sender and the group members is O(n), where n is the number of group members participating in the setup stage. However, the online complexity (which dominates the practicality of a ConBE scheme) is very low. We also illustrate a trade-off between the set-up complexity and the online performance. After a trade-off, the variant has O(n2=3) complexity in communication, computation and storage. This is comparable to up-to-date regular BE schemes which have O(n1=2) complexity in the same performance metrics, but our scheme does not require a trusted key dealer. We conduct a series of experiments and the experimental results validate the practicality of our scheme.

ADVANTAGES

1. In ConBE, anyone can send secret messages to any subset of the group members, and the system does not require a trusted key server.
2. As a versatile cryptographic primitive, our novel ConBE notion opens a new avenue to establish secure broadcast channels and can be expected to secure numerous emerging distributed computation applications.

SYSTEM CONFIGURATION

HARDWARE REQUIREMENTS:-

·                Processor          -   Pentium –III

·                Speed                -    1.1 Ghz

·                RAM                 -    256 MB(min)

·                Hard Disk         -   20 GB

·                Floppy Drive    -    1.44 MB

·                Key Board         -    Standard Windows Keyboard

·                Mouse               -    Two or Three Button Mouse

·                Monitor             -    SVGA

SOFTWARE REQUIREMENTS:-

·                Operating System      : Windows  7                                       

·                Front End                  : JSP AND SERVLET

·                Database                   : MYSQL

·                Tool                           :NETBEANS

 

REFERENCE

Wu, Q. Qin, B.  Zhang, L. Domingo-Ferrer, J.“Contributory Broadcast Encryption With Efficient Encryption And Short Cipher Texts,” IEEE Transactions on Computers, Volume PP Issue 99, APRIL 2015.

CONTINUOUS AND TRANSPARENT USER IDENTITY VERIFICATION FOR SECURE INTERNET SERVICES

ABSTRACT

Session management in distributed Internet services is traditionally based on username and password, explicit logouts and mechanisms of user session expiration using classic timeouts. Emerging biometric solutions allow substituting username and password with biometric data during session establishment, but in such an approach still a single verification is deemed sufficient, and the identity of a user is considered immutable during the entire session. Additionally, the length of the session timeout may impact on the usability of the service and consequent client satisfaction. This paper explores promising alternatives offered by applying biometrics in the management of sessions. A secure protocol is defined for perpetual authentication through continuous user verification. The protocol determines adaptive timeouts based on the quality, frequency and type of biometric data transparently acquired from the user. The functional behavior of the protocol is illustrated through Mat lab simulations, while model-based quantitative analysis is carried out to assess the ability of the protocol to contrast security attacks exercised by different kinds of attackers. Finally, the current prototype for PCs and Android smart phones is discussed.

AIM

The aim of this paper is explores promising alternatives offered by applying biometrics in the management of sessions. A secure protocol is defined for perpetual authentication through continuous user verification.

SCOPE:

The Scope of this paper is tends to protocol determines adaptive timeouts based on the quality, frequency and type of biometric data transparently acquired from the user.

EXISTING SYSTEM

To timely detect misuses of computer resources and prevent that an unauthorized user maliciously replaces an authorized one, solutions based on multi-modal biometric continuous authentication  are proposed, turning user verification into a continuous process rather than a onetime occurrence . To avoid that a single biometric trait is forged, biometrics authentication can rely on multiple biometrics traits. Finally, the use of biometric authentication allows credentials to be acquired transparently, i.e. without explicitly notifying the user or requiring his/her interaction, which is essential to guarantee better service usability. We present some examples of transparent acquisition of biometric data. Face can be acquired while the user is located in front of the camera, but not purposely for the acquisition of the biometric data; e.g., the user may be reading a textual SMS or watching a movie on the mobile phone. Voice can be acquired when the user speaks on the phone or with other people nearby if the microphone always captures background. Key-stroke data can be acquired whenever the user types on the keyboard, for example when writing an SMS, chat-ting, or browsing on the Internet.

DISADVANTAGES

1.  In such an approach still a single verification is deemed sufficient, and the identity of a user is considered immutable during the entire session
2.   The length of the session timeout may impact on the usability of the service and consequent client satisfaction.

PROPOSED SYSTEM

This paper a new approach for user verification and session management that is applied in the CASHMA (Context Aware Security by Hierarchical Multilevel Architectures) system for secure bi-metrics authentication on the Internet. CASHMA is able to operate securely with any kind of web service, including services with high security demands as online banking services, and it is intended to be used from different client devices e.g., smart phones, Desktop PCs or even biometric kiosks placed at the entrance of secure areas. De-pending on the preferences and requirements of the owner of the web service, the CASHMA authentication ser-vice can complement a traditional authentication service, or can replace it. CASHMA for usable and highly secure user sessions is a continuous sequential (a single biometric modality at once is presented to the system multi-modal biometric authentication protocol, which adaptively computes and refreshes session timeouts on the basis of the trust put in the client. Such global trust is evaluated as a numeric value, computed by continuously evaluating the trust both in the user and the (biometric) subsystems used for acquiring biometric data.

ADVANTAGES

1.  The novel possibility introduced by biometrics to define a protocol for continuous authentication that improves security and usability of user session. Avoidance of (complex) homomorphic (or any type of public-key) encryption of the multimedia content.
2.  When data is acquired in an uncontrolled environment, the quality of biometric data could strongly depend on the surroundings.

SYSTEM CONFIGURATION

HARDWARE REQUIREMENTS:-

·       Processor          -   Pentium –III

·                Speed                -    1.1 Ghz

·                RAM                 -    256 MB(min)

·                Hard Disk         -   20 GB

·                Floppy Drive    -    1.44 MB

·                Key Board         -    Standard Windows Keyboard

·                Mouse               -    Two or Three Button Mouse

·                Monitor             -    SVGA

SOFTWARE REQUIREMENTS:-

·                Operating System              : Windows  7                                       

·                Front End                  : JSP AND SERVLET

·                Database                  : MYSQL

·                Tool                           :NETBEANS

  

REFERENCE

Montecchi, L. , Brancati, F. ,Lollini, P. Ceccarelli, A.,“ Continuous and Transparent User Identity Verification for Secure Internet Services,” IEEE Transactions on Dependable and Secure Computing, Volume 12  Issue 3 , January 2014.