Results 251 to 260 of about 7,584,370 (305)
Some of the next articles are maybe not open access.
2017
Multi-key fully homomorphic encryption MFHE schemes allow polynomially many users without trusted setup assumptions to send their data encrypted under different FHE keys chosen by users independently of each other to an honest-but-curious server that can compute the output of an arbitrary polynomial-time computable function on this joint data and issue
Wutichai Chongchitmate, Rafail Ostrovsky
openaire +3 more sources
Multi-key fully homomorphic encryption MFHE schemes allow polynomially many users without trusted setup assumptions to send their data encrypted under different FHE keys chosen by users independently of each other to an honest-but-curious server that can compute the output of an arbitrary polynomial-time computable function on this joint data and issue
Wutichai Chongchitmate, Rafail Ostrovsky
openaire +3 more sources
Private-Key Fully Homomorphic Encryption for Private Classification
2018Fully homomophic encryption enables private computation over sensitive data, such as medical data, via potentially quantum-safe primitives. In this extended abstract we provide an overview of an implementation of a private-key fully homomorphic encryption scheme in a protocol for private Naive Bayes classification.
Alexander Wood +4 more
openaire +1 more source
Private-key algebraic-code encryptions
IEEE Transactions on Information Theory, 1989Summary: Public-key cryptosystems using very large distance algebraic codes were studied in the past. Private-key cryptosystems using simpler codes have also been the subject of a recent study. A new approach to the private- key cryptosystems is proposed which allows use of very simple codes of distance \(\leq 6\) and length of 250 bits or less.
Thammavarapu R. N. Rao, Kil-Hyun Nam
openaire +2 more sources
2003
Section 3.1 presents some classical ciphers for which both plaintext and cipher-text are characters or strings of characters. Section 3.2 covers the theory of modern cryptosystems and describes two early ciphers: Lucifer and DES. Section 3.3 presents five private-key block ciphers: FEAL, IDEA, RC6, Rijndael, and Serpent, of which the last three took ...
Josef Pieprzyk +2 more
openaire +1 more source
Section 3.1 presents some classical ciphers for which both plaintext and cipher-text are characters or strings of characters. Section 3.2 covers the theory of modern cryptosystems and describes two early ciphers: Lucifer and DES. Section 3.3 presents five private-key block ciphers: FEAL, IDEA, RC6, Rijndael, and Serpent, of which the last three took ...
Josef Pieprzyk +2 more
openaire +1 more source
Private-Key Hidden Vector Encryption with Key Confidentiality
2009Predicate encryption is an important cryptographic primitive that has been recently studied [BDOP04, BW07, GPSW06, KSW08] and that has found wide applications. Roughly speaking, in a predicate encryption scheme the owner of the master secret key K can derive secret key $\tilde K$, for any pattern vector k .
BLUNDO, Carlo +2 more
openaire +3 more sources
1999
Encryption techniques can use either public keys or secret keys. Secret-key encryption techniques use a secret key which is only known by the two communicating parities, as illustrated in Figure 18.1. This key can be fixed or can be passed from the two parties over a secure communications link (for example over the postal network or a leased line). The
openaire +1 more source
Encryption techniques can use either public keys or secret keys. Secret-key encryption techniques use a secret key which is only known by the two communicating parities, as illustrated in Figure 18.1. This key can be fixed or can be passed from the two parties over a secure communications link (for example over the postal network or a leased line). The
openaire +1 more source
Single Private-Key Generator Security Implies Multiple Private-Key Generators Security
2018This paper discusses the security of identity-based cryptography with multiple private-key generators (mPKG-IBC). Most mPKG-IBC schemes and protocols are statically secure where private-key generators (PKGs) cannot control a binding between a party and its PKG.
Atsushi Fujioka, Kazuki Yoneyama
openaire +1 more source
A Signature Scheme with a Fuzzy Private Key
2015In this paper, we introduce a new concept that we call fuzzy signature, which is a signature scheme that uses a noisy string such as biometric data as a private key, but does not require auxiliary data (which is also called helper string in the context of fuzzy extractors), for generating a signature.
Kenta Takahashi +4 more
openaire +1 more source
Forward-Security in Private-Key Cryptography
2003This paper provides a comprehensive treatment of forwardsecurity in the context of shared-key based cryptographic primitives, as a practical means to mitigate the damage caused by key-exposure. We provide definitions of security, practical proven-secure constructions, and applications for the main primitives in this area.
Mihir Bellare, Bennet S. Yee
openaire +3 more sources
2012
In this chapter we introduce the basic ideas and concepts underlying private-key encryption (also called symmetric encryption). Particularly important is the concept of security, which for the classical ciphers studied in the first chapter was not precisely defined.
openaire +1 more source
In this chapter we introduce the basic ideas and concepts underlying private-key encryption (also called symmetric encryption). Particularly important is the concept of security, which for the classical ciphers studied in the first chapter was not precisely defined.
openaire +1 more source