Sciweavers

252 search results - page 19 / 51
» How Secure is Deterministic Encryption
Sort
View
ASIACRYPT
2003
Springer
14 years 26 days ago
Generalized Powering Functions and Their Application to Digital Signatures
This paper investigates some modular powering functions suitable for cryptography. It is well known that the Rabin encryption function is a 4-to-1 mapping and breaking its one-wayn...
Hisayoshi Sato, Tsuyoshi Takagi, Satoru Tezuka, Ka...
SP
1997
IEEE
139views Security Privacy» more  SP 1997»
13 years 11 months ago
Number Theoretic Attacks on Secure Password Schemes
Encrypted Key Exchange (EKE) [1, 2] allows two parties sharing a password to exchange authenticated information over an insecure network by using a combination of public and secre...
Sarvar Patel
ICWS
2004
IEEE
13 years 9 months ago
Best-Practice Patterns and Tool Support for Configuring Secure Web Services Messaging
This paper presents an emerging tool for security configuration of service-oriented architectures with Web Services. Security is a major concern when implementing mission-critical...
Michiaki Tatsubori, Takeshi Imamura, Yuhichi Nakam...
CCS
1998
ACM
13 years 12 months ago
Cryptanalysis of Microsoft's Point-to-Point Tunneling Protocol (PPTP)
The Point-to-Point Tunneling Protocol (PPTP) is used to secure PPP connections over TCP/IP links. In this paper we analyze Microsoft's Windows NT implementation of PPTP. We s...
Bruce Schneier, Mudge
PKC
2007
Springer
111views Cryptology» more  PKC 2007»
14 years 1 months ago
Optimistic Fair Exchange in a Multi-user Setting
: This paper addresses the security of optimistic fair exchange in a multi-user setting. While the security of public key encryption and public key signature schemes in a single-us...
Yevgeniy Dodis, Pil Joong Lee, Dae Hyun Yum