Sciweavers

773 search results - page 27 / 155
» On Cryptographic Assumptions and Challenges
Sort
View
STACS
2009
Springer
14 years 4 months ago
Generating Shorter Bases for Hard Random Lattices
We revisit the problem of generating a “hard” random lattice together with a basis of relatively short vectors. This problem has gained in importance lately due to new cryptogr...
Joël Alwen, Chris Peikert
STOC
1998
ACM
121views Algorithms» more  STOC 1998»
14 years 1 months ago
Non-Interactive and Non-Malleable Commitment
A commitment protocol is a fundamental cryptographic primitive used as a basic buildingblock throughoutmodern cryptography. In STOC 1991, Dolev Dwork and Naor showed that in many ...
Giovanni Di Crescenzo, Yuval Ishai, Rafail Ostrovs...
DLT
2007
13 years 11 months ago
Inapproximability of Nondeterministic State and Transition Complexity Assuming P=!NP
Abstract. Inapproximability results concerning minimization of nondeterministic finite automata relative to given deterministic finite automata were obtained only recently, modul...
Hermann Gruber, Markus Holzer
ADT
2006
13 years 9 months ago
Data Confidentiality: to which extent cryptography and secured hardware can help
Data confidentiality has become a major concern for individuals as well as for companies and administrations. In a classical client-server setting, the access control management is...
Nicolas Anciaux, Luc Bouganim, Philippe Pucheral
INFORMATICALT
2007
112views more  INFORMATICALT 2007»
13 years 9 months ago
A New ID-Based Deniable Authentication Protocol
Abstract. Deniable authenticated protocol is a new cryptographic authentication protocol that enables a designated receiver to identify the source of a given message without being ...
Rongxing Lu, Zhenfu Cao, Shengbao Wang, Haiyong Ba...