Results 1  10
of
430
ℓdiversity: Privacy beyond kanonymity
 IN ICDE
, 2006
"... Publishing data about individuals without revealing sensitive information about them is an important problem. In recent years, a new definition of privacy called kanonymity has gained popularity. In a kanonymized dataset, each record is indistinguishable from at least k − 1 other records with resp ..."
Abstract

Cited by 672 (13 self)
 Add to MetaCart
Publishing data about individuals without revealing sensitive information about them is an important problem. In recent years, a new definition of privacy called kanonymity has gained popularity. In a kanonymized dataset, each record is indistinguishable from at least k − 1 other records
Semantic Searchable Encryption Scheme based on Lattice in Quantumera
"... Abstract. When data is outsourced to a remote storage server, searchable encryption plays an important role to protect data privacy while allowing users to retrieve data in the massive ciphertext. As far as we know, most of the existing searchable encryption schemes work based on the bilinear map. ..."
Abstract
 Add to MetaCart
for future cloud storage, we suggest a public key encryption with semantic keyword search using the lattice based mechanism. The suggested scheme is proved secure against indistinguishable chosenkeyword attacks (INDCKA) based on learning with errors (LWE) problem. This scheme is believed to be secure
Slide Attacks
 Proceedings of Fast Software Encryption ’99, Lecture Notes in Computer Science 1636
, 1999
"... Abstract. In this paper we present a new kind of cryptanalytic attack which utilizes bugs in the hardware implementation of computer instructions. The best known example of such a bug is the Intel division bug, which resulted in slightly inaccurate results for extremely rare inputs. Whereas in most ..."
Abstract

Cited by 194 (11 self)
 Add to MetaCart
incorrectly can lead to full leakage of the secret key, sometimes with a single wellchosen ciphertext. Keywords: Bug attack, Fault attack, RSA, PohligHellman, ECC. 1
Indistinguishability amplification
, 2006
"... A random system is the abstraction of the inputoutput behavior of any kind of discrete system, in particular cryptographic systems. Many aspects of cryptographic security analyses and proofs can be seen as the proof that a certain random system (e.g. a block cipher) is indistinguishable from an ide ..."
Abstract

Cited by 18 (6 self)
 Add to MetaCart
A random system is the abstraction of the inputoutput behavior of any kind of discrete system, in particular cryptographic systems. Many aspects of cryptographic security analyses and proofs can be seen as the proof that a certain random system (e.g. a block cipher) is indistinguishable from
Secure Integration of Asymmetric and Symmetric Encryption Schemes
, 1999
"... This paper shows a generic and simple conversion from weak asymmetric and symmetric encryption schemes into an asymmetric encryption scheme which is secure in a very strong sense  indistinguishability against adaptive chosenciphertext attacks in the random oracle model. In particular, this convers ..."
Abstract

Cited by 206 (9 self)
 Add to MetaCart
This paper shows a generic and simple conversion from weak asymmetric and symmetric encryption schemes into an asymmetric encryption scheme which is secure in a very strong sense  indistinguishability against adaptive chosenciphertext attacks in the random oracle model. In particular
Keywords—Designated Verifiable, Discrete Logarithm Problem, Chosen Ciphertext Attack,
"... Abstract—This paper presents a strong designated verifiable signcryption scheme, in which a message is signcrypted by a signcryptor and only a specific receiver, who called a “designated verifier”, verifies it using his own secret key. The scheme is secure, as an adversary can not verify the signatu ..."
Abstract
 Add to MetaCart
been done and it is proved that, the proposed scheme can withstand an adaptive chosen ciphertext attack. This scheme can be very useful in organizations where there is a need to send confidential documents to a specific recipient. This scheme can also be applicable to real life scenarios, such as, e
On the Automatic Construction of Indistinguishable Operations
 In Cryptology ePrint Archive, Report 2005/174
, 2005
"... Abstract. An increasingly important design constraint for software running on ubiquitous computing devices is security, particularly against physical methods such as sidechannel attack. One well studied methodology for defending against such attacks is the concept of indistinguishable functions whi ..."
Abstract

Cited by 13 (4 self)
 Add to MetaCart
Abstract. An increasingly important design constraint for software running on ubiquitous computing devices is security, particularly against physical methods such as sidechannel attack. One well studied methodology for defending against such attacks is the concept of indistinguishable functions
Protocol Indistinguishability and the Computationally Complete Symbolic Attacker
"... Recently, we proposed a technique [1] to define a computationally complete symbolic attacker for the verification of security protocols. Such a symbolic attacker can do everything computational attackers can, and hence it is possible to avoid the numerous usual restrictions computational soundness ..."
Abstract
 Add to MetaCart
Recently, we proposed a technique [1] to define a computationally complete symbolic attacker for the verification of security protocols. Such a symbolic attacker can do everything computational attackers can, and hence it is possible to avoid the numerous usual restrictions computational
Indistinguishability: the other aspect of privacy
 In 3rd VLDB Workshop on Secure Data Management
, 2006
"... Abstract. Uncertainty and indistinguishability are two independent aspects of privacy. Uncertainty refers to the property that the attacker cannot tell which private value, among a group of values, an individual actually has, and indistinguishability refers to the property that the attacker cannot s ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
Abstract. Uncertainty and indistinguishability are two independent aspects of privacy. Uncertainty refers to the property that the attacker cannot tell which private value, among a group of values, an individual actually has, and indistinguishability refers to the property that the attacker cannot
Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure PublicKey Encryption
, 2001
"... We present several new and fairly practical publickey encryption schemes and prove them secure against adaptive chosen ciphertext attack. One scheme is based on Paillier's Decision Composite Residuosity (DCR) assumption [7], while another is based in the classical Quadratic Residuosity (QR) ..."
Abstract

Cited by 189 (7 self)
 Add to MetaCart
natural cryptographic indistinguishability properties, we show how to construct an efficient publickey encryption schemes secure against adaptive chosen ciphertext attack in the standard model. Our construction only uses the universal hash proof system as a primitive: no other primitives are required
Results 1  10
of
430