- Subscribe to this page:
- RSS
- Email Alert
International Association for Cryptologic Research
(141 results)-
White Papers
SSE Implementation of Multivariate PKCs on Modern X86 CPUs
July 17, 2009, 12:00am PDT
Multivariate Public Key Cryptosystems (MPKCs) are often touted as future-proofing against Quantum Computers. It also has been known for efficiency compared to "Traditional" alternatives. However,...
Provided by International Association for Cryptologic Research
-
White Papers
Secure Computation on the Web: Computing without Simultaneous Interaction
April 11, 2011, 12:00am PDT
Secure computation enables mutually suspicious parties to compute a joint function of their private inputs while providing strong security guarantees. Amongst other things, even if some of the...
Provided by International Association for Cryptologic Research
-
White Papers
Information-theoretic Bounds for Differentially Private Mechanisms
February 10, 2011, 12:00am PST
There are two active and independent lines of research that aim at quantifying the amount of information that is disclosed by computing on confidential data. Each line of research has developed...
Provided by International Association for Cryptologic Research
-
White Papers
Is Privacy Compatible With Truthfulness?
January 28, 2011, 12:00am PST
The authors investigate the mainstream interpretation of differential privacy, which says that given a differentially private mechanism, people are likely to share their data truthfully because...
Provided by International Association for Cryptologic Research
-
White Papers
Security Weakness of Two Authenticated Key Exchange Protocols From Pairings
May 30, 2010, 12:00am PDT
Recently, Liu proposed two authenticated multiple key exchange protocols using pairings, and claimed two protocols featured many security attributes. In this paper, the authors show that Liu's...
Provided by International Association for Cryptologic Research
-
White Papers
Two Improved Authenticated Multiple Key Exchange Protocols
May 9, 2010, 12:00am PDT
Many authenticated multiple key exchange protocols were published in recent years. In 2008, Lee et al. presented an authenticated multiple key exchange protocol based on bilinear pairings....
Provided by International Association for Cryptologic Research
-
White Papers
Correlated Product Security From Any One-Way Function and the New Notion of Decisional Correlated Product Security
February 23, 2010, 12:00am PST
It is well-known that the k-wise product of one-way functions remains one-way, but may no longer be when the k inputs are correlated. At TCC 2009, Rosen and Segev introduced a new notion known as...
Provided by International Association for Cryptologic Research
-
White Papers
Homomorphic Encryption Over Cyclic Groups Implies Chosen-Ciphertext Security
September 8, 2010, 12:00am PDT
Chosen-Ciphertext (IND-CCA) security is generally considered the right notion of security for a cryptosystem. Because of its central importance much effort has been devoted to constructing IND-CCA...
Provided by International Association for Cryptologic Research
-
White Papers
A New Framework for RFID Privacy
January 25, 2011, 12:00am PST
Formal RFID security and privacy frameworks are fundamental to the design and analysis of robust RFID systems. In this paper, the authors develop a new definitional framework for RFID privacy in a...
Provided by International Association for Cryptologic Research
-
White Papers
On Small Secret Key Attack Against RSA With High Bits Known Prime Factor
December 27, 2010, 12:00am PST
It is well known that if the higher half bits of a prime factor are known or the secret key is small enough then the RSA cryptosystem is broken (e.g. [Coppersmith, J. Cryptology, 1997] and...
Provided by International Association for Cryptologic Research
-
White Papers
ROTIV: RFID Ownership Transfer With Issuer Verification
December 15, 2010, 12:00am PST
RFID tags travel between partner sites in a supply chain. For privacy reasons, each partner "Owns" the tags present at his site, i.e., the owner is the only entity able to authenticate his tags....
Provided by International Association for Cryptologic Research
-
White Papers
No-Leak Authentication by the Sherlock Holmes Method
December 4, 2010, 12:00am PST
The authors propose a class of authentication schemes that are literally zero-knowledge, as compared to what is formally defined as "Zero-knowledge" in cryptographic literature. They call this...
Provided by International Association for Cryptologic Research
-
White Papers
Generic Compilers for Authenticated Key Exchange (Full Version)
December 28, 2010, 12:00am PST
So far, all solutions proposed for authenticated key agreement combine key agreement and authentication into a single cryptographic protocol. However, in many important application scenarios, key...
Provided by International Association for Cryptologic Research
-
White Papers
Scrutinizing Rebound Attacks: New Algorithms for Improving the Complexities
November 25, 2010, 12:00am PST
Rebound attacks are a state-of-the-art analysis method for hash functions. These cryptanalysis methods are based on a well chosen differential path and have been applied to several hash functions...
Provided by International Association for Cryptologic Research
-
White Papers
Secret Key Leakage From Public Key Perturbation of DLP-Based Cryptosystems
November 4, 2010, 12:00am PDT
Finding efficient countermeasures for cryptosystems against fault attacks is challenged by a constant discovery of aws in designs. Even elements, such as public keys, that do not seem critical...
Provided by International Association for Cryptologic Research
-
White Papers
The Cube Attack on Stream Cipher Trivium and Quadraticity Tests
November 14, 2010, 12:00am PST
In 2008 I. Dinur and A. Shamir presented a new type of algebraic attack on symmetric ciphers named cube attack. The method has been applied to reduced variants of stream ciphers Trivium and Grain-...
Provided by International Association for Cryptologic Research
-
White Papers
Strongly Secure Certificate-Based Encryption Scheme With Low Communication Bandwidth
November 2, 2010, 12:00am PDT
Certificate-Based Encryption (CBE) is a new asymmetric encryption paradigm which was introduced to solve the certificate management problem in traditional Public-Key Encryption (PKE). It combines...
Provided by International Association for Cryptologic Research
-
White Papers
Symmetric-Key Searchable Keyword Concealment (SSC)
October 26, 2010, 12:00am PDT
The authors discuss what is commonly known as "Searchable symmetric keywords encryption," although they prefer to replace "Encryption" with "Concealment," since many of these transformations are...
Provided by International Association for Cryptologic Research
-
White Papers
Security of ECQV-Certified ECDSA Against Passive Adversaries
March 9, 2011, 12:00am PST
The authors show that the Elliptic Curve Qu-Vanstone implicit certificate scheme (ECQV), when composed with the Elliptic Curve Digital Signature Algorithm (ECDSA), is secure against passive...
Provided by International Association for Cryptologic Research
-
White Papers
On the Analysis of Cryptographic Assumptions in the Generic Ring Model
December 17, 2009, 12:00am PST
At Eurocrypt 2009 Aggarwal and Maurer proved that breaking RSA is equivalent to factoring in the generic ring model. This model captures algorithms that may exploit the full algebraic structure of...
Provided by International Association for Cryptologic Research
-
White Papers
A Strong Blind Signature Scheme Over Braid Groups
December 10, 2009, 12:00am PST
The rapid development of quantum computing makes public key cryptosystems not based on commutative algebraic systems hot topic. Because of the non-commutativity property, the braid group with...
Provided by International Association for Cryptologic Research
-
White Papers
Security Analysis and Design of Proxy Signature Schemes Over Braid Groups
September 16, 2009, 12:00am PDT
The braid groups have attracted much attention as a new platform of constructing cryptosystems. This paper firstly analyzes the security vulnerabilities of existing proxy signature schemes over...
Provided by International Association for Cryptologic Research
-
White Papers
On Key Authentic Degree of Cryptosystem
September 20, 2009, 12:00am PDT
Against such attacks as rubber-hose attack, key authentic degree of cryptosystem is expatiated in detail, and the important significance of key authentic degree of cryptosystem is pointed out. And...
Provided by International Association for Cryptologic Research
-
White Papers
Cryptanalysis of the Niederreiter Public Key Scheme Based on GRS Subcodes
September 13, 2009, 12:00am PDT
In this paper a new structural attack on the McEliece/Niederreiter public key cryptosystem based on subcodes of generalized Reed-Solomon codes proposed by Berger and Loidreau is described. It...
Provided by International Association for Cryptologic Research
-
White Papers
Generalization of Barreto Et Al ID Based Signcryption Scheme
May 5, 2009, 12:00am PDT
This paper presents an efficient and provable secure identity based generalized signcryption scheme based on which can work as signcryption scheme, encryption scheme and signature scheme as per...
Provided by International Association for Cryptologic Research
-
White Papers
Certificateless Group Oriented Signature Secure Against Key Replacement Attack
April 4, 2009, 12:00am PDT
Since Al-Riyami and Paterson presented certificateless cryptography, many certificateless schemes have been proposed for different purposes. In this paper, the authors present a certificateless...
Provided by International Association for Cryptologic Research
-
White Papers
Flaws in Differential Cryptanalysis of Reduced Round PRESENT
July 20, 2010, 12:00am PDT
In this paper, the authors have presented flaws in differential cryptanalysis of reduced round variant of PRESENT given by M.Wang for 80 bits key length and the authors have shown that it is not...
Provided by International Association for Cryptologic Research
-
White Papers
Authenticated Key Exchange Secure Under the Computational Diffie-Hellman Assumption
August 6, 2008, 12:00am PDT
In this paper, the authors present a new Authenticated Key Exchange (AKE) protocol and prove its security under the random oracle assumption and the Computational Diffie-Hellman(CDH) assumption....
Provided by International Association for Cryptologic Research
-
White Papers
Provably Secure ID-Based Broadcast Signcryption (IBBSC) Scheme
May 18, 2008, 12:00am PDT
With the advent of mobile and portable devices such as cell phones and PDAs, wireless content distribution has become a major means of communications and entertainment. In such applications, a...
Provided by International Association for Cryptologic Research
-
White Papers
A Modular Security Analysis of the TLS Handshake Protocol
June 1, 2008, 12:00am PDT
The authors study the security of the widely deployed Secure Session Layer/Transport Layer Security (TLS) key agreement protocol. The analysis identifies, justifies, and exploits the modularity...
Provided by International Association for Cryptologic Research
-
White Papers
Cryptanalysis of a Client-to-Client Password-Authenticated Key Agreement Protocol
June 2, 2008, 12:00am PDT
Recently, Byun et al. proposed an efficient client-to-client password-authenticated key agreement protocol (EC2C-PAKA), which was provably secure in a formally defined security model. This letter...
Provided by International Association for Cryptologic Research
-
White Papers
Obtaining Universally Composable Security: Towards the Bare Bones of Trust
December 15, 2007, 12:00am PST
A desirable goal for cryptographic protocols is to guarantee security when the protocol is composed with other protocol instances. Universally Composable (UC) security provides this guarantee in a...
Provided by International Association for Cryptologic Research
-
White Papers
A New Provably Secure Authentication and Key Agreement Mechanism for SIP Using Certificateless Public-Key Cryptography
June 7, 2007, 12:00am PDT
The Session Initiation Protocol (SIP) is considered as the dominant signaling protocol for calls over the internet. However, SIP authentication typically uses HTTP digest authentication, which is...
Provided by International Association for Cryptologic Research
-
White Papers
Macro Data Load: An Efficient Mechanism for Enhancing Loaded Data Reuse
April 1, 2011, 12:00am PDT
This paper presents a study on macro data load, a novel mechanism to increase the amount of loaded data reuse within a processor. A macro data load brings into the processor a maximum-width data...
Provided by International Association for Cryptologic Research
-
White Papers
A New Stream Cipher: DICING
September 5, 2007, 12:00am PDT
In a synchronous stream cipher, the ciphertext is generally made by bitwise adding (XOR) the plaintext with a binary sequence called keystream. In case that the cipher is abused or the plaintext...
Provided by International Association for Cryptologic Research
-
White Papers
New features for JPEG Steganalysis
January 1, 2011, 12:00am PST
The authors present in this paper a new approach for specific JPEG steganalysis and propose studying statistics of the compressed DCT coefficients. Traditionally, steganographic algorithms try to...
Provided by International Association for Cryptologic Research
-
White Papers
New Constructions for Provably-Secure Time-Bound Hierarchical Key Assignment Schemes
January 1, 2011, 12:00am PST
A time-bound hierarchical key assignment scheme is a method to assign time-dependent encryption keys to a set of classes in a partially ordered hierarchy, in such a way that each class in the...
Provided by International Association for Cryptologic Research
-
White Papers
Efficient Provably-Secure Hierarchical Key Assignment Schemes
January 1, 2011, 12:00am PST
A hierarchical key assignment scheme is a method to assign some private information and encryption keys to a set of classes in a partially ordered hierarchy, in such a way that the private...
Provided by International Association for Cryptologic Research
-
White Papers
Traitor Tracing Scheme With Constant Ciphertext Rate Against Powerful Pirates
January 1, 2011, 12:00am PST
Traitor tracing schemes are used to fight piracy when distributing securely some data to multiple authorized receivers: If some receivers collude and share their decryption keys to build some...
Provided by International Association for Cryptologic Research
-
White Papers
Perturbing and Protecting a Traceable Block Cipher
January 1, 2011, 12:00am PST
At the Asiacrypt 2003 conference Billet and Gilbert introduce a block cipher, which, to quote them, has the following paradoxical traceability properties: it is computationally easy to derive many...
Provided by International Association for Cryptologic Research
-
Whitepapers
Quantum Money From Hidden Subspaces
March 24, 2012, 12:00am PDT
Forty years ago, Wiesner pointed out that quantum mechanics raises the striking possibility of money that cannot be counterfeited according to the laws of physics. The authors propose the first...
Provided by International Association for Cryptologic Research
-
Whitepapers
Attacking RSA-CRT Signatures with Faults on Montgomery Multiplication
April 2, 2012, 12:00am PDT
In this paper, the authors present several efficient fault attacks against implementations of RSA-CRT signatures that use modular exponentiation algorithms based on Montgomery multiplication. They...
Provided by International Association for Cryptologic Research
-
Whitepapers
Zero Knowledge with Rubik's Cubes
April 2, 2012, 12:00am PDT
Since the invention of the Rubik's cube by Erno Rubik in 1974, similar puzzles have been produced, with various number of faces or stickers. The authors can use these toys to define several...
Provided by International Association for Cryptologic Research
-
Whitepapers
Strongly Secure Authenticated Key Exchange from Factoring, Codes, and Lattices
April 17, 2012, 12:00am PDT
Establishing secure channels is one of the most important areas of cryptographic research. Secure channels provide secrecy and authenticity for both communication parties. When parties can share...
Provided by International Association for Cryptologic Research
-
Whitepapers
Perfect Algebraic Immune Functions
August 8, 2012, 12:00am PDT
The study of the cryptanalysis of the filter and combination generators of stream ciphers based on Linear Feedback Shift Registers (LFSRs) has resulted in a wealth of cryptographic criteria for...
Provided by International Association for Cryptologic Research
-
Whitepapers
Differentially Private Continual Monitoring of Heavy Hitters from Distributed Streams
April 20, 2012, 12:00am PDT
The authors consider applications scenarios where an untrusted aggregator wishes to continually monitor the heavy-hitters across a set of distributed streams. Since each stream can contain...
Provided by International Association for Cryptologic Research
-
Whitepapers
Physical Unclonable Functions in Cryptographic Protocols: Security Proofs and Impossibility Results
April 25, 2012, 12:00am PDT
The authors investigate the power of Physical Unclonable Functions (PUFs) as a new primitive in cryptographic protocols. Their contributions split into three parts; they focus on the realizability...
Provided by International Association for Cryptologic Research
-
Whitepapers
Ring-LWE in Polynomial Rings
June 3, 2012, 12:00am PDT
Since its recent introduction, the Ring-LWE problem [LPR10] has already been used as a building block for numerous cryptographic applications. In addition to its original functionality as the...
Provided by International Association for Cryptologic Research
-
Whitepapers
Zero-Knowledge for Multivariate Polynomials
April 18, 2012, 12:00am PDT
The first Zero-Knowledge schemes were based on the factorization problem (for example Fischer-Micali-Racko in 1984, or Fiat-Shamir in 1986) or the Graph Isomorphism Problem. However the...
Provided by International Association for Cryptologic Research
-
Whitepapers
Compress Multiple Ciphertexts Using Elgamal Encryption Schemes
August 10, 2012, 12:00am PDT
ElGamal encryption is one of fundamental public-key cryptosystems. One of its main advantages is that it is simple and efficient, but also that its chosen-plaintext security is clearly understood....
Provided by International Association for Cryptologic Research
-
Whitepapers
A Secret Sharing Scheme Based on Group Presentations and the Word Problem
March 27, 2012, 12:00am PDT
A (t, n)-threshold secret sharing scheme is a method to distribute a secret among n participants in such a way that any t participants can recover the secret, but no t - 1 participants can. In...
Provided by International Association for Cryptologic Research
-
Whitepapers
Full Proof Cryptography: Verifiable Compilation of Efficient Zero-Knowledge Protocols
June 29, 2012, 12:00am PDT
Developers building cryptography into security-sensitive applications face a daunting task. Not only must they understand the security guarantees delivered by the constructions they choose, they...
Provided by International Association for Cryptologic Research
-
Whitepapers
Transposition of AES Key Schedule
May 8, 2012, 12:00am PDT
In this paper, the authors point out a new weakness of the AES key schedule by revisiting an old observation exploited by many known attacks. They also discover a major cause for this weakness is...
Provided by International Association for Cryptologic Research
-
Whitepapers
Compilation Techniques for Efficient Encrypted Computation
May 10, 2012, 12:00am PDT
Fully Homomorphic Encryption (FHE) techniques are capable of performing encrypted computation on Boolean circuits, i.e., the user specifies encrypted inputs to the program, and the server computes...
Provided by International Association for Cryptologic Research
-
Whitepapers
Cyptanalysis CDHP, BDHP and Tate Pairing Under Certain Conditions the Tate Pairing is Less Secure Than Weil
May 16, 2012, 12:00am PDT
This paper fall within the cadre of Cryptanalysis. Because, under certain condition, the authors would give a fairly simple method to solve the CDHP (the Problem Computational of Diffie and...
Provided by International Association for Cryptologic Research
-
Whitepapers
Ring Group Signatures
May 23, 2012, 12:00am PDT
In many applications of group signatures, not only a signer's identity but also which group the signer belongs to is sensitive information regarding signer privacy. In this paper, the authors...
Provided by International Association for Cryptologic Research
-
Whitepapers
Two Grumpy Giants and a Baby
July 9, 2012, 12:00am PDT
Pollard's rho algorithm, along with parallelized, vectorized, and negating variants, is the standard method to compute discrete logarithms in generic prime-order groups. This paper presents two...
Provided by International Association for Cryptologic Research
-
Whitepapers
Broadcast-Enhanced Key Predistribution Schemes
May 24, 2012, 12:00am PDT
The authors present a formalization of a category of schemes which they call Broadcast-enhanced Key Predistribution Schemes. These schemes can be used instead of a key predistribution scheme in...
Provided by International Association for Cryptologic Research
-
Whitepapers
Anonymous Credentials Light
May 28, 2012, 12:00am PDT
The authors define and propose an efficient and provably secure construction of blind signatures with attributes. Prior notions of blind signatures did not yield themselves to the construction of...
Provided by International Association for Cryptologic Research
-
Whitepapers
On Instance Separation in the UC-Framework
May 30, 2012, 12:00am PDT
The UC approach of Canetti offers the advantage of stand-alone analysis while keeping security guaranties for arbitrary complex environment. When the authors implement by this approach, first they...
Provided by International Association for Cryptologic Research
-
Whitepapers
Fast and Compact Elliptic-Curve Cryptography
September 7, 2012, 12:00am PDT
Elliptic curve signatures have many advantages, however. Current attacks against elliptic curves scale exponentially with key size. Therefore ECC key and signatures can be considerably smaller...
Provided by International Association for Cryptologic Research
-
Whitepapers
Generation of Nonlinear Feedback Shift Registers with Special-Purpose Hardware
June 3, 2012, 12:00am PDT
The NonLinear Feedback Shift Registers (NLFSR) are used to construct pseudorandom generators for stream ciphers. Their theory is not so complete as that of the Linear Feedback Shift Registers...
Provided by International Association for Cryptologic Research
-
Whitepapers
The Discrete Logarithm Problem in Non-Representable Rings
June 6, 2012, 12:00am PDT
For Discrete Logarithm based cryptography, it is desirable to find efficiently implementable groups for which sub-exponential algorithms for the Discrete Logarithm Problem are not available. Thus...
Provided by International Association for Cryptologic Research
-
Whitepapers
3D Hardware Canaries
June 4, 2012, 12:00am PDT
3D integration is a promising advanced manufacturing process offering a variety of new hardware security protection opportunities. This paper presents a way of securing 3D ICs using Hamiltonian...
Provided by International Association for Cryptologic Research
-
Whitepapers
A Way Reduce Signed Bitwise Differences That Transformed Into Same Modular Differences
June 9, 2012, 12:00am PDT
The authors study signed bitwise differences and modular differences. They find a way to reduce signed bitwise differences that can be transformed into same modular differences. In this way, it...
Provided by International Association for Cryptologic Research
-
Whitepapers
RSA Modulus Generation in the Two-Party Case
June 13, 2012, 12:00am PDT
In this paper, secure two-party protocols are provided in order to securely generate a random k-bit RSA modulus n keeping its factorization secret. The authors show that most existing two-party...
Provided by International Association for Cryptologic Research
-
Whitepapers
Another Look at Non-Uniformity
July 6, 2012, 12:00am PDT
In the classical model of computational complexity - also called the uniform model - an algorithm, informally speaking, is a fixed set of instructions that can be applied to any admissible input...
Provided by International Association for Cryptologic Research
-
Whitepapers
Multiparty Proximity Testing with Dishonest Majority from Equality Testing
July 4, 2012, 12:00am PDT
Motivated by the recent widespread emergence of Location-Based Services (LBS) over mobile devices, the authors explore efficient protocols for proximity-testing. Such protocols allow a group of...
Provided by International Association for Cryptologic Research
-
Whitepapers
A Framework for Efficient Fully-Equipped UC Commitments
December 21, 2012, 12:00am PST
Universal Composability (UC) framework guarantees that if a protocol is being proven secure in the UC framework, it remains secure even if it is run concurrently with arbitrary (even insecure)...
Provided by International Association for Cryptologic Research
-
Whitepapers
New Cryptographic Constructions Using Generalized LWE
May 16, 2012, 12:00am PDT
The Learning With Errors (LWE) problem, introduced by Regev in 2005, and its extension, Ring Learning With Errors (RLWE) problem have attracted a lot of attentions in theory and applications due...
Provided by International Association for Cryptologic Research
-
Whitepapers
Wide Strong Private RFID Identification Based on Zero-Knowledge
August 22, 2012, 12:00am PDT
The authors present the first wide-strong RFID identification protocol that is based on zero-knowledge. Until now this notion has only been achieved by schemes based on INDCCA2 encryption....
Provided by International Association for Cryptologic Research
-
Whitepapers
Regular Ternary Algorithm for Scalar Multiplication on Elliptic Curves over Finite Fields of Characteristic Three
July 14, 2012, 12:00am PDT
Elliptic curve cryptosystems, proposed independently by Neal Koblitz and Victor Miller are more and more widespread in everyday-life applications. The core operation of elliptic curve...
Provided by International Association for Cryptologic Research
-
Whitepapers
An ID-Based Key Agreement Protocol Based on ECC Among Users of Separate Networks
May 18, 2012, 12:00am PDT
In this paper, the authors propose an identity based key agreement protocol based on Elliptic Curve Cryptography (ECC) between users of different networks with independent Private Key Generations...
Provided by International Association for Cryptologic Research
-
Whitepapers
A New Efficient Authenticated ID-Based Group Key Agreement Protocol
July 16, 2012, 12:00am PDT
Group Key Agreement (GKA) protocols Play a main role in constructing secure multicast channels. These protocols are algorithms that describe how a group of parties communicating over a public...
Provided by International Association for Cryptologic Research
-
Whitepapers
PIRMAP: Efficient Private Information Retrieval for MapReduce
October 17, 2012, 12:00am PDT
Private Information Retrieval (PIR) allows for retrieval of bits from a database in a way that hides a user's access pattern from the server. However, its practicality in a real-world cloud...
Provided by International Association for Cryptologic Research
-
Whitepapers
An Algebraic Fault Attack on the LED Block Cipher
May 12, 2012, 12:00am PDT
In this paper, the authors propose an attack on block ciphers where they combine techniques derived from algebraic and fault based cryptanalysis. The recently introduced block cipher LED serves...
Provided by International Association for Cryptologic Research
-
Whitepapers
Cryptanalysis of an Identity-Based Multiple Key Agreement Scheme
May 7, 2012, 12:00am PDT
Multiple Key Agreement (MKA) protocols allow two parties to generate two or more session keys in one session, which will be used for future secure communications in public network. In recent...
Provided by International Association for Cryptologic Research
-
Whitepapers
Revisiting Key Schedule's Diffusion In Relation with Round Function's Diffusion
July 25, 2012, 12:00am PDT
The authors study the weakness of key schedules from an observation: many existing attacks use the fact that the key schedules poorly distribute key bits in the diffusion path of round function....
Provided by International Association for Cryptologic Research
-
Whitepapers
Beyond eCK: Perfect Forward Secrecy under Actor Compromise and Ephemeral-Key Reveal
July 25, 2012, 12:00am PDT
The majority of recently developed key exchange protocols have been proven secure with respect to game-based security models for key exchange protocols. The first such security model was...
Provided by International Association for Cryptologic Research
-
Whitepapers
A Generalised Formula for Calculating the Resilience of Random Key Predistribution Schemes
July 27, 2012, 12:00am PDT
A commonly used metric for comparing the resilience of key pre-distribution schemes is fails, which measures the proportion of network connections which are 'broken' by an adversary which has...
Provided by International Association for Cryptologic Research
Keep Up with TechRepublic
Submit a Paper
Get your content listed in our directory!
Our directory is the largest library of vendor-supplied technical content on the Web. It’s also the first place IT decision makers turn to when researching technology solutions. Our members are already finding your competitors’ papers here - shouldn’t they find yours, too? It's FREE so click here and submit your white paper, case study, data sheet, research report, or other document today!
