• No results found

Functions That Are Not Length-Preserving

{Adiantum}:  length-preserving  encryption  for  entry-level  processors

{Adiantum}: length-preserving encryption for entry-level processors

... input length · tweakable encryption · disk encryption 1 Introduction Two aspects of disk encryption make it a challenge for ...decryption functions who can choose tweak and plaintext/ciphertext freely is ...

24

On  the  Optimality  of  Non-Linear  Computations  of  Length-Preserving  Encryption  Schemes

On the Optimality of Non-Linear Computations of Length-Preserving Encryption Schemes

... Abstract. It is well known that three and four rounds of balanced Feis- tel cipher or Luby-Rackoff (LR) encryption for two blocks messages are pseudorandom permutation (PRP) and strong pseudorandom permuta- tion (SPRP) ...

22

Balancing  Output  Length   and  Query  Bound  in  Hardness  Preserving  Constructions  of  Pseudorandom  Functions

Balancing Output Length and Query Bound in Hardness Preserving Constructions of Pseudorandom Functions

... hash functions and hash the bits using a hash function h 1 to 2t bits anyway (t is chosen to be log q, where q = 2 √ n is the bound on the number of queries that the adversary can make to F) and then evaluate the ...

12

Length functions for semigroup embeddings

Length functions for semigroup embeddings

... for all g ∈ S. The discussion above implies that the word length in S does not depend up to equivalence on the choice of finite generating set. We will also be considering a semigroup analogue of the notion of ...

15

Time-changes preserving zeta functions

Time-changes preserving zeta functions

... a n = Fix (X,T) (n) = |{x ∈ X | T n x = x}| for all n > 1. In this case we will also say that the sequence (a n ) is realized by the system (X, T ). If we require X to be a compact metric space and T to be a ...

15

State of the Art in Similarity Preserving Hashing Functions

State of the Art in Similarity Preserving Hashing Functions

... Similarity preserving hashing functions help to accomplish that mission through a resemblance comparison between different ...best-known functions of this type are the context-triggered piecewise ...

7

Adversarially  Robust  Property  Preserving  Hash  Functions

Adversarially Robust Property Preserving Hash Functions

... gap-Hamming preserving hash for sparse vectors (||x|| 0 ≤ βn), we can extend this to work for the full ...the length of the vector; we need to more than quadruple the length of x to get the density ...

53

On metric-preserving functions and fixed point theorems

On metric-preserving functions and fixed point theorems

... Since f (x) ∈ [, ] for all x > , f is tightly bounded. Therefore by Lemma , f is metric preserving. It is easy to see that f is not increasing (and is not concave either). So f is not a metric transform. It ...

14

Fuzzy membership functions in privacy preserving data mining

Fuzzy membership functions in privacy preserving data mining

... Privacy preserving data mining Privacy Preserving Data mining with Fuzzy Logic Fuzzy logic can be applied in Privacy preserving data mining for anonymization of data to preserve sensitive data in a ...

5

Compression  Functions  Suitable  for  the  Multi-Property-Preserving  Transform

Compression Functions Suitable for the Multi-Property-Preserving Transform

... multi-property preserving domain extension transform, the problem of the construction for multi-property hash functions has been reduced to that of the con- struction for multi-property compression ...hash ...

11

Provably  Secure  Public-Key  Encryption  for  Length-Preserving  Chaumian  Mixes

Provably Secure Public-Key Encryption for Length-Preserving Chaumian Mixes

... Usually it is desireable to allow source routing, i.e. let senders choose mix chains on a per-message basis. This increases the flexibility of the whole scheme: senders can make use of new mixes that go into operation, ...

18

The  preimage  security  of  double-block-length  compression  functions

The preimage security of double-block-length compression functions

... 3 Institute of Theoretical Computer Science, Tsinghua University, Beijing, China, [email protected] Abstract. We give improved bounds on the preimage security of the three “classical” double-block-length, double- ...

16

A General Family of the Srivastava-Gupta Operators  Preserving Linear Functions

A General Family of the Srivastava-Gupta Operators Preserving Linear Functions

... The present investigation was motivated essentially by the fact that the widely-studied Srivastava-Gupta operator V n,c (f, x) preserves only the constant functions, but not linear functions. Here, in this ...

5

Order-Preserving Derivative Approximation with Periodic Radial Basis Functions

Order-Preserving Derivative Approximation with Periodic Radial Basis Functions

... The paper is organized as follows. In section 2, we establish the necessary nota- tion and definitions for kernel interpolants on the circle, associated function spaces, and other theoretical machinery. We discuss the ...

30

Privacy-preserving comparison of variable-length data with application to biometric template protection

Privacy-preserving comparison of variable-length data with application to biometric template protection

... ABSTRACT The establishment of cloud computing and big data in a wide variety of daily applications has raised some privacy concerns due to the sensitive nature of some of the processed data. This has promoted the need to ...

14

Experience with AMS 700 LGX penile prostheses for preserving penile length in Korea

Experience with AMS 700 LGX penile prostheses for preserving penile length in Korea

... penile length was longer than the preoperative ...penile length in patients who are concerned about decreases in their original penile length and has a low rate of complications and mechanical ...

6

Indifferentiability  of  Single-Block-Length   and  Rate-1  Compression  Functions

Indifferentiability of Single-Block-Length and Rate-1 Compression Functions

... compression functions has been studied in ...compression functions are secure against the ...compression functions. They concluded that the 12 compression functions of Preneel et ...

12

Blockcipher-based  Double-length  Hash  Functions  for  Pseudorandom  Oracles

Blockcipher-based Double-length Hash Functions for Pseudorandom Oracles

... The use of the constant values c 1 and c 2 in the post-processing function is inspired by the design technique of EMD proposed by Bellare and Ristenpart [1]. This realizes the fact that the post-processing function ...

18

View of Preserving grammatical functions in LFG
							| Bergen Language and Linguistics Studies

View of Preserving grammatical functions in LFG | Bergen Language and Linguistics Studies

... Preserving grammatical functions in LFG Ronald M. Kaplan Abstract. Patejuk and Przepiórkowski (2016) have provided arguments and evidence to call into question the traditional role that named grammatical ...

16

Characterizing  Padding  Rules  of  MD  Hash  Functions  Preserving  Collision  Security

Characterizing Padding Rules of MD Hash Functions Preserving Collision Security

... 6 Conclusion We study padding rules in different aspects which is very essential for designing hash function. Appending 1 followed by a suitable size sequence of 0 and binary representation of length is a very ...

14

Show all 10000 documents...

Related subjects