Sciweavers

324 search results - page 47 / 65
» A new signature scheme without random oracles
Sort
View
STOC
2009
ACM
156views Algorithms» more  STOC 2009»
14 years 9 months ago
Polynomial-time theory of matrix groups
We consider matrix groups, specified by a list of generators, over finite fields. The two most basic questions about such groups are membership in and the order of the group. Even...
László Babai, Robert Beals, Á...
AFRICACRYPT
2010
Springer
13 years 11 months ago
Efficient Unidirectional Proxy Re-Encryption
Abstract. Proxy re-encryption (PRE) allows a semi-trusted proxy to convert a ciphertext originally intended for Alice into one encrypting the same plaintext for Bob. The proxy only...
Sherman S. M. Chow, Jian Weng, Yanjiang Yang, Robe...
PET
2010
Springer
14 years 12 days ago
Making a Nymbler Nymble Using VERBS
In this work, we propose a new platform to enable service providers, such as web site operators, on the Internet to block past abusive users of anonymizing networks (for example, T...
Ryan Henry, Kevin Henry, Ian Goldberg
IACR
2011
136views more  IACR 2011»
12 years 8 months ago
Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
We give new methods for generating and using “strong trapdoors” in cryptographic lattices, which are simultaneously simple, efficient, easy to implement (even in parallel), a...
Daniele Micciancio, Chris Peikert
CRYPTO
2003
Springer
101views Cryptology» more  CRYPTO 2003»
14 years 1 months ago
The Impact of Decryption Failures on the Security of NTRU Encryption
NTRUEncrypt is unusual among public-key cryptosystems in that, with standard parameters, validly generated ciphertexts can fail to decrypt. This affects the provable security prop...
Nick Howgrave-Graham, Phong Q. Nguyen, David Point...