Sciweavers

ASIACRYPT
2009
Springer
14 years 5 months ago
Smooth Projective Hashing and Password-Based Authenticated Key Exchange from Lattices
Abstract. We describe a public-key encryption scheme based on lattices — specifically, based on the hardness of the learning with error (LWE) problem — that is secure against ...
Jonathan Katz, Vinod Vaikuntanathan
ASIACRYPT
2009
Springer
14 years 5 months ago
A Framework for Universally Composable Non-committing Blind Signatures
A universally composable (UC) blind signature functionality requres users to commit to the message to be blindly signed. It is thereby impossible to realize in the plain model. Th...
Masayuki Abe, Miyako Ohkubo
ASIACRYPT
2009
Springer
14 years 5 months ago
On the Power of Two-Party Quantum Cryptography
Louis Salvail, Christian Schaffner, Miroslava Sot&...
ASIACRYPT
2009
Springer
14 years 5 months ago
Security Notions and Generic Constructions for Client Puzzles
Computational puzzles are mildly difficult computational problems that require resources (processor cycles, memory, or both) to solve. Puzzles have found a variety of uses in secu...
Liqun Chen, Paul Morrissey, Nigel P. Smart, Bogdan...
ASIACRYPT
2009
Springer
14 years 5 months ago
Foundations of Non-malleable Hash and One-Way Functions
Non-malleability is an interesting and useful property which ensures that a cryptographic protocol preserves the independence of the underlying values: given for example an encryp...
Alexandra Boldyreva, David Cash, Marc Fischlin, Bo...
ASIACRYPT
2009
Springer
14 years 5 months ago
Secure Multi-party Computation Minimizing Online Rounds
Multi-party secure computations are general important procedures to compute any function while keeping the security of private inputs. In this work we ask whether preprocessing can...
Seung Geol Choi, Ariel Elbaz, Tal Malkin, Moti Yun...
ASIACRYPT
2009
Springer
14 years 5 months ago
Secure Two-Party Computation Is Practical
Abstract. Secure multi-party computation has been considered by the cryptographic community for a number of years. Until recently it has been a purely theoretical area, with few im...
Benny Pinkas, Thomas Schneider, Nigel P. Smart, St...
CTRSA
2009
Springer
155views Cryptology» more  CTRSA 2009»
14 years 5 months ago
Cryptanalysis of CTC2
CTC is a toy cipher designed in order to assess the strength of algebraic attacks. While the structure of CTC is deliberately weak with respect to algebraic attacks, it was claimed...
Orr Dunkelman, Nathan Keller
CTRSA
2009
Springer
158views Cryptology» more  CTRSA 2009»
14 years 5 months ago
Square, a New Multivariate Encryption Scheme
We propose and analyze a multivariate encryption scheme that uses odd characteristic and an embedding in its construction. This system has a very simple core map F(X) = X2 , allowi...
Crystal Clough, John Baena, Jintai Ding, Bo-Yin Ya...
CTRSA
2009
Springer
205views Cryptology» more  CTRSA 2009»
14 years 5 months ago
Key Insulation and Intrusion Resilience over a Public Channel
Mihir Bellare, Shanshan Duan, Adriana Palacio